Aspects of Semidefinite Programming - Interior Point Algorithms and Selected Applications (Hardcover, 2002 ed.)

Semidefinite programming has been described as linear programming for the year 2000. It is an exciting new branch of mathematical programming, due to important applications in control theory, combinatorial optimization and other fields. Moreover, the successful interior point algorithms for linear programming can be extended to semidefinite programming.
In this monograph the basic theory of interior point algorithms is explained. This includes the latest results on the properties of the central path as well as the analysis of the most important classes of algorithms. Several "classic" applications of semidefinite programming are also described in detail. These include the Lov sz theta function and the MAX-CUT approximation algorithm by Goemans and Williamson.
Audience: Researchers or graduate students in optimization or related fields, who wish to learn more about the theory and applications of semidefinite programming.

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	Applied Optimization, 65
Release date:	March 2002
First published:	2002
Authors:	E. de Klerk
Dimensions:	235 x 155 x 19mm (L x W x T)
Format:	Hardcover
Pages:	288
Edition:	2002 ed.
ISBN-13:	978-1-4020-0547-3
Categories:	Books > Computing & IT > Computer programming > General Books > Science & Mathematics > Mathematics > Optimization > General Books > Science & Mathematics > Mathematics > Applied mathematics > General Promotions
LSN:	1-4020-0547-4
Barcode:	9781402005473

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!