Aspects of Semidefinite Programming

Interior Point Algorithms and Selected Applications

  • Etienne de Klerk

Part of the Applied Optimization book series (APOP, volume 65)

Table of contents

About this book


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.


Algorithms algorithm combinatorial optimization linear optimization optimization programming

Authors and affiliations

  • Etienne de Klerk
    • 1
  1. 1.Delft University of TechnologyDelftThe Netherlands

Bibliographic information

  • DOI
  • Copyright Information Kluwer Academic Publishers 2002
  • Publisher Name Springer, Boston, MA
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4020-0547-3
  • Online ISBN 978-0-306-47819-2
  • Series Print ISSN 1384-6485
  • Buy this book on publisher's site