Verkäufer
Kennys Bookstore, Olney, MD, USA
Verkäuferbewertung 5 von 5 Sternen
AbeBooks-Verkäufer seit 9. Oktober 2009
Semidefinite programming has been described as linear programming for the year 2000. This monograph explains the basic theory of interior point algorithms. It includes the results on the properties of the central path as well as the analysis of the most important classes of algorithms. Series: Applied Optimization. Num Pages: 304 pages, biography. BIC Classification: PBU; PBW; UMG. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 235 x 155 x 19. Weight in Grams: 609. . 2002. Hardback. . . . . Books ship from the US and Ireland. Bestandsnummer des Verkäufers V9781402005473
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.
Titel: Aspects of Semidefinite Programming
Verlag: Kluwer Academic Publishers
Erscheinungsdatum: 2002
Einband: Hardcover
Zustand: New