Semidefinite Programming and Polynomial Optimization

  • Konrad Schmüdgen
Chapter
First Online:
Part of the Graduate Texts in Mathematics book series (GTM, volume 277)

Abstract

“Finding” the minimum or infimum pmin of a real polynomial p over a semi-algebraic set \(\mathcal{K}(\mathsf{f})\) is a basic optimization problem. Sum of squares decompositions of polynomials by means of Positivstellensätze and moment problem methods provide powerful tools for polynomial optimization. The aim of this chapter is to give a short digression into these applications by outlining the main ideas.

This is a preview of subscription content, log in to check access.

Bibliography

  1. [AL]
    Anjos, M.A. and J.B. Lasserre (Editors): Handbook on Semidefinite, Conic and Polynomial Optimization, Internat. Ser. Oper. Res. and Management Sci. 166, Springer-Verlag, New York, 2012.Google Scholar
  2. [BN]
    Ben-Tal, A. and A. Nemirovsky: Lectures on Modern Convex Optimization, SIAM, Philadelpia, 2001.CrossRefGoogle Scholar
  3. [BTB]
    Blekherman, G., R.R. Thomas, and P.A. Parillo (Editors): Semidefinite Optimization and Convex Algebraic Geometry, MOS-SIAM Series Optimization 13, Philadelphia, 2012.Google Scholar
  4. [Ls1]
    Lasserre, J.B.: Global optimization with polynomials and the problem of moments, SIAM J. Optim. 11(2001), 796–817.MATHGoogle Scholar
  5. [Ls2]
    Lasserre, J.B.: Moments, Positive Polynomials and Their Applications, Imperial College London, 2010.MATHGoogle Scholar
  6. [La2]
    Laurent, M.: Sums of squares, moment matrices and optimization, In: Emerging Applications of Algebraic Geometry, M. Putinar and S. Sullivant (Editors), Springer, New York, 2009, 157–270.CrossRefGoogle Scholar
  7. [Ms1]
    Marshall, M.: Positive Polynomials and Sums of Squares, Math. Surveys and Monographs 146, Amer. Math. Soc., Providence, R.I., 2008.Google Scholar
  8. [Ms2]
    Marshall, M.: Representations of non-negative polynomials, degree bounds and applications to optimization, Canad. J. Math. 61(2009), 205–221.CrossRefMATHMathSciNetGoogle Scholar
  9. [Nie]
    Nie, J.: Optimimality conditions and finite convergence of Lasserre’s hierarchy, Math. Program. Ser. A 14(2014), 97–121.CrossRefMATHGoogle Scholar
  10. [OW]
    Overton, M. and R.S. Womersley: On the sum of the k largest eigenvalues of a symmetric matrix, SIAM J. Matrix Anal. Appl. 13(1992), 41–45.CrossRefMATHMathSciNetGoogle Scholar
  11. [Pa]
    Parillo, P.A.: Semidefinite programming relaxations for semialgebraic problems, Math. Program 9(2003), 293–320.CrossRefMathSciNetGoogle Scholar
  12. [Sw3]
    Schweighofer, M.: Optimization of polynomials on compact semi-algebraic sets, SIAM J. Optimization 15(2005), 805–825.CrossRefMATHMathSciNetGoogle Scholar
  13. [V]
    Vandenberghe, L. (Editor): Handbook of Semidefinite Programming: Theory, Algorithm, and Applications, Kluwer Academic, Boston, 2005.Google Scholar
  14. [VB]
    Vandenberghe, L. and S. Boyd: Semidefinite programming, SIAM Rev. 38(1996), 49–95.CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Konrad Schmüdgen
    • 1
  1. 1.Mathematisches InstitutUniversität LeipzigLeipzigGermany

Personalised recommendations