A bounded degree SOS hierarchy for polynomial optimization

Original Paper


We consider a new hierarchy of semidefinite relaxations for the general polynomial optimization problem \((P):\,f^{*}=\min \{f(x):x\in K\}\) on a compact basic semi-algebraic set \(K\subset \mathbb {R}^n\). This hierarchy combines some advantages of the standard LP-relaxations associated with Krivine’s positivity certificate and some advantages of the standard SOS-hierarchy. In particular it has the following attractive features: (a) in contrast to the standard SOS-hierarchy, for each relaxation in the hierarchy, the size of the matrix associated with the semidefinite constraint is the same and fixed in advance by the user; (b) in contrast to the LP-hierarchy, finite convergence occurs at the first step of the hierarchy for an important class of convex problems; and (c) some important techniques related to the use of point evaluations for declaring a polynomial to be zero and to the use of rank-one matrices make an efficient implementation possible. Preliminary results on a sample of non convex problems are encouraging.


Global optimization Polynomial optimization convex relaxations LP and semidefinite hierarchies 

Mathematics Subject Classification

90C26 90C22 



The work of the first author is partially supported by a PGMO grant from Fondation Mathématique Jacques Hadamard, and an ERC-ADG grant from the European Research Council (ERC): grant agreement 666981 TAMING.


  1. Ahmadi AA, Majumdar A (2014) DSOS and SDSOS Optimization: LP and SOCP-Based Alternatives to SOS Optimization. In: Proceedings of the 48th annual conference on information sciences and systems, Princeton, NJ, USA, pp 1–5Google Scholar
  2. Benabbas S, Magen A (2010) Extending SDP integrality gaps to Sherali–Adams with applications to quadratic programming and MaxCutGain, In: Shepherd FB (ed) Integer programming and combinatorial optimization. Lecture Notes in Computer Science, Springer, New York, pp 299–312Google Scholar
  3. Curto RE, Fialkow LA (2000) The truncated complex K-moment problem. Trans Amer Math Soc 352:2825–2855CrossRefGoogle Scholar
  4. Curto RE, Fialkow LA (2005) Truncated K-moment problem in several variables. J Op Theory 54:189–226Google Scholar
  5. Chlamtac E, Tulsiani M (2012) Convex relaxations and integrality gaps. In: Anjos M, Lasserre JB (eds) Handbook of semidefinite, conic and polynomial optimization. Springer, New York, pp 139–170CrossRefGoogle Scholar
  6. de Klerk E, Laurent M (2011) On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems. SIAM J Optim 21:824–832Google Scholar
  7. Floudas CA, Pardalos PM (1990) A collection of test problems for constrained global optimization algorithms. Lecture Notes in Computer Science, vol 455, Springer, BerlinGoogle Scholar
  8. Henrion D, Lasserre JB (2005) Detecting global optimality and extracting solutions in Gloptipoly. In: Henrion D, Garulli A(eds) Positive polynomials in control, Lecture Notes in Control and Information Science, vol 312, pp 293–310Google Scholar
  9. Henrion D, Lasserre JB, Lofberg J (2009) GloptiPoly 3: moments, optimization and semidefinite programming. Optim Methods Softw 24:761–779CrossRefGoogle Scholar
  10. Helton JW, Nie J (2010) Semidefinite representations of convex sets. Math Program 122:21–64CrossRefGoogle Scholar
  11. Krivine JL (1964) Anneaux préordonnés. J Anal Math 12:307–326CrossRefGoogle Scholar
  12. Lasserre JB (2001) Global optimization with polynomials and the problem of moments. SIAM J Optim 11:796–817CrossRefGoogle Scholar
  13. Lasserre JB (2002) Semidefinite programming vs. LP relaxations for polynomial programming. Math Op Res 27:347–360CrossRefGoogle Scholar
  14. Lasserre JB (2009) Convexity in semi-algebraic geometry and polynomial optimization. SIAM J Optim 19:1995–2014CrossRefGoogle Scholar
  15. Lasserre JB (2009) Moments, positive polynomials and their applications. Imperial College Press, LondonCrossRefGoogle Scholar
  16. Lasserre JB (2013) A Lagrangian relaxation view of linear and semidefinite hierarchies. SIAM J Optim 23:1742–1756CrossRefGoogle Scholar
  17. Laurent M (2003) A comparison of the Sherali–Adams, Lovász-Schrijver and Lasserre relaxations for 0–1 programming. Math Op Res 28:470–496CrossRefGoogle Scholar
  18. Marshall M (2009) Representation of non-negative polynomials, degree bounds and applications to optimization. Can J Math 61:205–221CrossRefGoogle Scholar
  19. Nie J (2014) Optimality conditions and finite convergence of Lasserre’s hierarchy. Math Program 146:97–121CrossRefGoogle Scholar
  20. Putinar M (1993) Positive polynomials on compact semi-algebraic sets. Ind Univ Math J 42:969–984CrossRefGoogle Scholar
  21. Sherali HD, Adams WP (1990) A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J Discr Math 3:411–430CrossRefGoogle Scholar
  22. Sherali HD, Adams WP (1999) A reformulation-linearization technique for solving discrete and continuous nonconvex problems. Kluwer, Dordrecht, MACrossRefGoogle Scholar
  23. Stengle G (1974) A nullstellensatz and a positivstellensatz in semialgebraic geometry. Math Ann 207:87–97CrossRefGoogle Scholar
  24. Toh KC, Todd MJ, Tutuncu RH (1999) SDPT3—a Matlab software package for semidefinite programming. Optim Methods Softw 11:545–581CrossRefGoogle Scholar
  25. Toh KC, Todd MJ, Tutuncu RH (2003) Solving semidefinite-quadratic-linear programs using SDPT3. Math Program 95:189–217CrossRefGoogle Scholar
  26. Waki S, Kim S, Kojima M, Maramatsu M (2006) Sums of squares and semidefinite programming relaxations for polynomial optimization problems with structured sparsity. SIAM J Optim 17:218–242CrossRefGoogle Scholar

Copyright information

© EURO - The Association of European Operational Research Societies 2015

Authors and Affiliations

  • Jean B. Lasserre
    • 1
  • Kim-Chuan Toh
    • 2
  • Shouguang Yang
    • 2
  1. 1.LAAS-CNRS and Institute of MathematicsUniversity of ToulouseToulouseFrance
  2. 2.Department of MathematicsNational University of SingaporeSingaporeSingapore

Personalised recommendations