Journal of Global Optimization

, Volume 75, Issue 4, pp 885–919 | Cite as

A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs

  • T. D. Chuong
  • V. JeyakumarEmail author
  • G. Li


In this paper, we propose a bounded degree hierarchy of both primal and dual conic programming relaxations involving both semi-definite and second-order cone constraints for solving a nonconvex polynomial optimization problem with a bounded feasible set. This hierarchy makes use of some key aspects of the convergent linear programming relaxations of polynomial optimization problems (Lasserre in Moments, positive polynomials and their applications, World Scientific, Singapore, 2010) associated with Krivine–Stengle’s certificate of positivity in real algebraic geometry and some advantages of the scaled diagonally dominant sum of squares (SDSOS) polynomials (Ahmadi and Hall in Math Oper Res, 2019.; Ahmadi and Majumdar in SIAM J Appl Algebra Geom 3:193–230, 2019). We show that the values of both primal and dual relaxations converge to the global optimal value of the original polynomial optimization problem under some technical assumptions. Our hierarchy, which extends the so-called bounded degree Lasserre hierarchy (Lasserre et al. in Eur J Comput Optim 5:87–117, 2017), has a useful feature that the size and the number of the semi-definite and second-order cone constraints of the relaxations are fixed and independent of the step or level of the approximation in the hierarchy. As a special case, we provide a convergent bounded degree second-order cone programming (SOCP) hierarchy for solving polynomial optimization problems. We then present finite convergence at step one of the SOCP hierarchy for classes of polynomial optimization problems. This includes one-step convergence for a new class of first-order SDSOS-convex polynomial programs. In this case, we also show how a global solution is recovered from the level one SOCP relaxation. We finally derive a corresponding convergent conic linear programming hierarchy for conic-convex semi-algebraic programs. Whenever the semi-algebraic set of the conic-convex program is described by concave polynomial inequalities, we show further that the values of the relaxation problems converge to the common value of the convex program and its Lagrangian dual under a constraint qualification.


Nonconvex polynomial optimization Conic programming relaxations Global optimization Cone-convex polynomial programs Convex semi-algebraic programs 



The authors would like to thank the referees for their valuable comments and suggestions which greatly improved the original version of the paper.


  1. 1.
    Ahmadi, A.A., Hall, G.: On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity. Math. Oper. Res. (2019). CrossRefGoogle Scholar
  2. 2.
    Ahmadi, A.A., Majumdar, A.: DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization. SIAM J. Appl. Algebra Geom. 3, 193–230 (2019)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Ahmadi, A.A., Parrilo, P.A.: A complete characterization of the gap between convexity and SOS-convexity. SIAM J. Optim. 23(2), 811–833 (2013)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Belousov, E.G., Klatte, D.: A Frank–Wolfe type theorem for convex polynomial programs. Comput. Optim. Appl. 22(1), 37–48 (2002)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Bertsimas, D., Freund, R.M., Sun, X.A.: An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems. Optim. Methods Softw. 28, 424–441 (2013)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)CrossRefGoogle Scholar
  7. 7.
    Chuong, T.D., Jeyakumar, V.: Convergent conic linear programming relaxations for cone convex polynomial programs. Oper. Res. Lett. 45(3), 220–226 (2017)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Chuong, T.D., Jeyakumar, V.: Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers. J. Global Optim. 72(4), 655–678 (2018)MathSciNetCrossRefGoogle Scholar
  9. 9.
    D’Angelo, P., Putinar, M.: Polynomial Optimization on Odd-Dimensional Spheres, in Emerging Applications of Algebraic Geometry. Springer, New York (2008)Google Scholar
  10. 10.
    Fidalgo, C., Kovacec, A.: Positive semidefinite diagonal minus tail forms are sums of squares. Math. Z. 269, 629–645 (2011)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Floudas, C.A., Pardalos, P.M., Adjiman, C.S., Esposito, W.R., Gumus, Z.H., Harding, S.T., Klepeis, J.L., Meyer, C.A., Schweiger, C.A.: Handbook of Test Problems in Local and Global Optimization. Kluwer Academic Publishers, Dordrecht (1999)CrossRefGoogle Scholar
  12. 12.
    Ghaddar, B., Vera, J.C., Anjos, M.F.: A dynamic inequality generation scheme for polynomial programming. Math. Program. 156, 21–57 (2016)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Ghasemi, M., Marshall, M.: Lower bounds for polynomials using geometric programming. SIAM J. Optim. 22(2), 460–473 (2012)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Henrion, D., Lasserre, J.B., Loefberg, J.: GloptiPoly 3: moments, optimization and semidefinite programming. Optim. Methods Softw. 24, 761–779 (2009)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Horn, R., Johnson, C.R.: Matrix Analysis, 2nd edn, p. xviii+643. Cambridge University Press, Cambridge (2013)zbMATHGoogle Scholar
  16. 16.
    Hu, S., Li, G., Qi, L.: A tensor analogy of Yuan’s theorem of the alternative and polynomial optimization with sign structure. J. Optim. Theory Appl. 168(2), 446–474 (2016)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Helton, J.W., Nie, J.W.: Semidefinite representation of convex sets. Math. Program. 122, 21–64 (2010)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Jeyakumar, V.: Constraint qualifications characterizing Lagrangian duality in convex optimization. J. Optim. Theory Appl. 136(1), 31–41 (2008)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Jeyakumar, V., Lee, G.M., Li, G.: Alternative theorems for quadratic inequality systems and global quadratic optimization. SIAM J. Optim. 2, 667–690 (2009)MathSciNetzbMATHGoogle Scholar
  20. 20.
    Jeyakumar, V., Li, G.: Exact conic programming relaxations for a class of convex polynomial cone programs. J. Optim. Theory Appl. 172(1), 156–178 (2017)MathSciNetCrossRefGoogle Scholar
  21. 21.
    Jeyakumar, V., Kim, S., Lee, G.M., Li, G.: Solving global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets. J. Global Optim. 65, 175–190 (2016)MathSciNetCrossRefGoogle Scholar
  22. 22.
    Josa, C., Molzahn, D.: Lasserre hierarchy for large scale polynomial optimization in real and complex variables. SIAM J. Optim. 28, 1017–1048 (2018)MathSciNetCrossRefGoogle Scholar
  23. 23.
    Krivine, J.L.: Anneaux préordonnés. J. Anal. Math. 12, 307–326 (1964)CrossRefGoogle Scholar
  24. 24.
    Kim, S., Kojima, M.: Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations. Comput. Optim. Appl. 26(2), 143–154 (2003)MathSciNetCrossRefGoogle Scholar
  25. 25.
    Kuang, X., Ghaddar, B., Naoum-Sawaya, J., Zuluaga, L.F.: Alternative SDP and SOCP approximations for polynomial optimization. Eur. J. Comp. Optim. 7, 153–175 (2019)MathSciNetCrossRefGoogle Scholar
  26. 26.
    Lasserre, J.B.: A Lagrangian relaxation view of linear and semidefinite hierarchies. SIAM J. Optim 23(3), 1742–1756 (2013)MathSciNetCrossRefGoogle Scholar
  27. 27.
    Lasserre, J.B.: Moments, Positive Polynomials and Their Applications. World Scientific, Singapore (2010)zbMATHGoogle Scholar
  28. 28.
    Lasserre, J.B.: Representation of nonnegative convex polynomial. Arch. Math. 91, 126–130 (2008)MathSciNetCrossRefGoogle Scholar
  29. 29.
    Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Putinar, M., Sullivant, S. (eds.) Emerging Applications of Algebraic Geometry, Vol. 149 of IMA Volumes in Mathematics and its Applications, vol. 149, pp. 157–270. Springer, Berlin (2009)Google Scholar
  30. 30.
    Lasserre, J.B., Toh, K.C., Yang, S.: A bounded degree SOS hierarchy for polynomial optimization. Eur. J. Comput. Optim. 5, 87–117 (2017)MathSciNetCrossRefGoogle Scholar
  31. 31.
    Mordukhovich, B.S., Nam, N.M.: An Easy Path to Convex Analysis and Applications, Synthesis Lectures on Mathematics and Statistics, 14. Morgan & Claypool Publishers, Williston (2014)Google Scholar
  32. 32.
    Megretski, A.: SPOT (Systems polynomial optimization tools) Manual, 2010,
  33. 33.
    Nie, J.W.: Polynomial matrix inequality and semidefinite representation. Math. Oper. Res. 36, 398–415 (2011)MathSciNetCrossRefGoogle Scholar
  34. 34.
    Nie, J.W., Wang, L.: Regularization methods for SDP relaxations in large-scale polynomial optimization. SIAM J. Optim. 22, 408–428 (2012)MathSciNetCrossRefGoogle Scholar
  35. 35.
    Parrilo, P.A.: Semidefinite programming relaxations for semialgebraic problems. Math. Program. 96, 293–320 (2003)MathSciNetCrossRefGoogle Scholar
  36. 36.
    Shapiro, A.: First and second order analysis of nonlinear semidefinite programs. Math. Program. 77, 301–320 (1997)MathSciNetzbMATHGoogle Scholar
  37. 37.
    Waki, H., Kim, S., Kojima, M., Muramatsu, M.: Sums of squares and semidefinite programming relaxations for polynomial optimization problems with structured sparsity. SIAM J. Optim. 17, 218–242 (2006)MathSciNetCrossRefGoogle Scholar
  38. 38.
    Weisser, T., Lasserre, J., Toh, K.: Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity. Math. Program. Comput. 5, 1–32 (2017)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Department of Applied MathematicsUniversity of New South WalesSydneyAustralia
  2. 2.Department of Mathematics and ApplicationsSaigon UniversityHo Chi Minh CityVietnam

Personalised recommendations