Aspects of Semidefinite Programming : Interior Point Algorithms and Selected Applications

E. de Klerk

ISBN 10: 1441952160 / ISBN 13: 9781441952165

Published by Springer US, 2010

About this Item

Druck auf Anfrage Neuware - Printed after ordering - 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.

Seller Inventory # 9781441952165

Bibliographic Details

• Title: Aspects of Semidefinite Programming : Interior Point Algorithms and Selected Applications
• Publisher: Springer US
• Publication Date: 2010
• Language: English
• ISBN 10: 1441952160
• ISBN 13: 9781441952165
• Binding: Taschenbuch
• Condition: Neu

About this title

Synopsis

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.