- Main Menu-

Catalogue Tag Display

MARC 21

Semidefinite optimization and convex algebraic geometry
Tag	Description
020	$a978-1-611972-28-3
082	$a516.35
099	$a512.7 BLE
100	$aBlekherman, Grigoriy
245	$aSemidefinite optimization and convex algebraic geometry$hM$cedited by Grigoriy Blekherman; Pablo A. Parrilo; Rekha R. Thomas
260	$aPhiladelphia, Pa.$bSociety for Industrial and Applied Mathematics$c2013
300	$aXIX, 476 pages$bill.$c24 cm.
440	$aMOS-SIAM series on optimization$v13
520	$aThis book provides a self-contained, accessible introduction to the mathematical advances and challenges resulting from the use of semidefinite programming in polynomial optimization. This important and highly applicable research area with contributions from convex geometry, algebraic geometry, and optimization is known as convex algebraic geometry. Each chapter addresses a fundamental aspect of the topic, beginning with an introduction to nonnegative polynomials and sums of squares, and their connections to semidefinite programming. The material quickly advances to areas at the forefront of current research, including semidefinite representability of convex sets, duality theory in algebraic geometry, and nontraditional topics such as sums of squares of complex forms. The book is a suitable entry point to the subject for readers at the graduate level or above in mathematics, engineering or computer science. Instructors will find the book appropriate for a class or seminar, and researchers will encounter open problems and new research directions.
700	$aBlekherman, Grigoriy
700	$aParrilo, Pablo A.
700	$aThomas, Rekha R.$d1967-