Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (13 chapters)
-
Front Matter
-
Back Matter
About this book
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.
Authors and Affiliations
-
Delft University of Technology, Delft, The Netherlands
Etienne Klerk
Bibliographic Information
Book Title: Aspects of Semidefinite Programming
Book Subtitle: Interior Point Algorithms and Selected Applications
Authors: Etienne Klerk
Series Title: Applied Optimization
DOI: https://doi.org/10.1007/b105286
Publisher: Springer New York, NY
-
eBook Packages: Springer Book Archive
Copyright Information: Springer Science+Business Media Dordrecht 2002
Hardcover ISBN: 978-1-4020-0547-3Published: 31 March 2002
Softcover ISBN: 978-1-4419-5216-5Published: 10 December 2010
eBook ISBN: 978-0-306-47819-2Published: 18 April 2006
Series ISSN: 1384-6485
Edition Number: 1
Number of Pages: XVI, 288
Topics: Programming Techniques, Optimization, Applications of Mathematics, Algorithms, Theory of Computation, Computational Mathematics and Numerical Analysis