Aspects of Semidefinite Programming

Aspects of Semidefinite Programming : Interior Point Algorithms and Selected Applications

By (author) 

Free delivery worldwide

Available. Dispatched from the UK in 4 business days
When will my order arrive?


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 Lovasz 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 more

Product details

  • Hardback | 304 pages
  • 172.7 x 236.7 x 21.8mm | 603.29g
  • Kluwer Academic Publishers
  • Dordrecht, Netherlands, United States
  • English
  • 2002 ed.
  • biography
  • 1402005474
  • 9781402005473

Table of contents

Acknowledgments. List of notation. 1. Introduction. Part I: Theory and Algorithms. 2. Duality, Optimality, and Degeneracy. 3. The Central Path. 4. Self-Dual Embeddings. 5. The Primal Logarithmic Barrier Method. 6. Primal-Dual Affine-Scaling Methods. 7. Primal-Dual Path-Following Methods. 8. Primal-Dual Potential Reduction Methods. Part II: Applications. 9. Convex Quadratic Approximation. 10. The Lovasz upsilon-Function. 11. Graph Colouring and the Max-Kappa-Cut Problem. 12. The Stability Number of a Graph. 13. The Satisfiability Problem. Appendices. References. more