Semidefinite Optimization

Part of the Springer Undergraduate Texts in Mathematics and Technology book series (SUMAT)


Semidefinite optimization (SDO) differs from linear optimization (LO) in that it deals with optimization problems over the cone of symmetric positive semidefinite matrices Sn+ instead of nonnegative vectors. In many cases the objective function is linear and SDO can be interpreted as an extension of LO. It is a branch of convex optimization and contains — besides LO — linearly constrained QP, quadratically constrained QP and — for example — second-order cone programming as special cases.


Dual Problem Primal Problem Feasible Point Linear Optimization Central Path 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Be/Ne.
    A. Ben-Tal, A. Nemirovski (2001): Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. SIAM, PhiladelphiaMATHGoogle Scholar
  2. Todd 2.
    M. J. Todd (2001): Semidefinite Optimization. Acta Numerica 10, pp. 515–560MATHCrossRefMathSciNetGoogle Scholar
  3. Hel.
    C. Helmberg (2002): Semidefinite Programming. European J. Operational Research 137, pp. 461–482Google Scholar
  4. LVBL.
    M. S. Lobo et al. (1998): Applications of Second Order Cone Programming. Linear Algebra and its Applications 284, pp. 193–228MATHCrossRefMathSciNetGoogle Scholar
  5. YYH.
    H. Yamashita, H. Yabe, K. Harada (2007): A Primal-Dual Interior Point Method for Nonlinear Semidefinite Programming. Technical Report, Department of Math. Information Science, TokyoGoogle Scholar
  6. Toh.
    K.Ċ. Toh (1999): Primal-Dual Path-Following Algorithms for Determinant Maximization Problems with Linear Matrix Inequalities. Computational Optimization and Applications 14, pp. 309–330MATHCrossRefMathSciNetGoogle Scholar
  7. VBW.
    L. Vandenberghe, S. Boyd, S. P. Wu (1998): Determinant Maximization with Linear Matrix Inequality Constraints. SIAM J. on Matrix Analysis and Applications 19, pp. 499–533Google Scholar
  8. Ro/Wo.
    C. Roos, J. van der Woude (2006): Convex Optimization and System Theory.
  9. HKR.
    M. Halická, E. de Klerk, C. Roos (2002): On the Convergence of the Central Path in Semidefinite Optimization. SIAM J. Optimization 12, pp. 1090–1099Google Scholar
  10. Todd 1.
    M. J. Todd (1999): A Study of Search Directions in Primal-Dual Interior-Point Methods for Semidefinite Programming. Optimization Methods and Software 11, pp. 1–46CrossRefMathSciNetGoogle Scholar
  11. HRVW.
    C. Helmberg et al. (1996): An Interior-Point Method for Semidefinite Programming. SIAM J. Optimization 6, pp. 342–361Google Scholar
  12. KSH.
    M. Kojima, S. Shindoh, S. Hara (1997): A note on the Nesterov-Todd and the Kojima-Shindoh-Hara Search Directions in Semidefinite Programming. SIAM J. Optimization 7, pp. 86–125Google Scholar
  13. Mon.
    R. D. C. Monteiro (1997): Primal-Dual Path-Following Algorithms for Semidefinite Programming. SIAM J. Optimization 7, pp. 663–678Google Scholar
  14. WSV.
    H. Wolkowicz, R. Saigal, L. Vandenberghe (eds.) (2000): Handbook of Semidefinite Programming: Theory, Algorithms and Applications. Kluwer, Boston, Dordrecht, LondonGoogle Scholar
  15. Klerk.
    E. de Klerk (2002): Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications. Kluwer, Boston, Dordrecht, LondonMATHGoogle Scholar
  16. Gli.
    F. Glineur (1998): Pattern Separation via Ellipsoids and Conic Programming. Mémoire de D.E.A. (Master’s Thesis), Faculté Polytechnique de Mons, BelgiumGoogle Scholar
  17. Bo/Va.
    S. Boyd, L. Vandenberghe (2004): Convex Optimization. Cambridge University Press, CambridgeMATHGoogle Scholar
  18. Hal.
    P. R. Halmos (1993): Finite-Dimensional Vector Spaces. Springer, Berlin, Heidelberg, New YorkGoogle Scholar
  19. An/Lu.
    A. Antoniou, W. Lu (2007): Practical Optimization: Algorithms and Engineering Applications. Springer, Berlin, Heidelberg, New YorkMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Fak. Mathematik und Wirtschaftswissenschaften Inst. Numerische MathematikUniversität UlmUlmGermany
  2. 2.FB Mathematik und StatistikUniversität KonstanzKonstanzGermany

Personalised recommendations