Skip to main content
SpringerLink
Log in

Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

We observe that in a simple one-dimensional polynomial optimization problem (POP), the ‘optimal’ values of semidefinite programming (SDP) relaxation problems reported by the standard SDP solvers converge to the optimal value of the POP, while the true optimal values of SDP relaxation problems are strictly and significantly less than that value. Some pieces of circumstantial evidences for the strange behaviors of the SDP solvers are given. This result gives a warning to users of the SDP relaxation method for POPs to be careful in believing the results of the SDP solvers. We also demonstrate how SDPA-GMP, a multiple precision SDP solver developed by one of the authors, can deal with this situation correctly.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Belloni, A., Freund, R.M.: A geometric analysis of Renegar’s condition number, and its interplay with conic curvature. Math. Program. 119, 95–107 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  2. de Klerk, E., Elabwabi, G., den Hertog, D.: Optimization of univariate functions on bounded intervals by interpolation and semidefinite programming. Discussion paper, 2006-026, Tilburg University, Center for Economic Research (2006)

  3. Freund, R.M., Vera, J.R.: Condition-based complexity of convex optimization in conic linear form via the ellipsoid algorithm. SIAM J. Optim. 10(1), 155–176 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  4. Freund, R.M., Ordóñez, F., Toh, K.C.: Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems. Math. Program. 109, 445–475 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fujisawa, K., Fukuda, M., Kobayashi, K., Kojima, M., Nakata, K., Nakata, M., Yamashita, M.: SDPA (SemiDefinite Programming Algorithm) and SDPA-GMP User’s Manual—Version 7.1.0. Research Reports on Mathematical and Computing Sciences, B-448 (2008)

  6. The GNU MP Bignum Library: Available from http://gmplib.org/

  7. Henrion, D., Lasserre, J.B., Loefberg, J.: GLOPTIPOLY 3: moments, optimization and semidefinite programming (2007). Available from http://www.laas.fr/~henrion/software/gloptipoly/

  8. Henrion, D., Lasserre, J.B.: Detecting global optimality and extracting solutions in GloptiPoly. In: Henrion, D., Garulli, A. (eds.) Positive Polynomials in Control. Lecture Notes on Control and Information Sciences, vol. 312. Springer, Berlin (2005)

    Google Scholar 

  9. Kuhlmann, S., Marshall, M.: Positivity, sums of squares and the multi-dimensional moment problem. Trans. Am. Math. Soc., 354(11), 4285–4301 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  10. Lasserre, J.B.: Global optimization with polynomials and the problems of moments. SIAM J. Optim. 11, 796–817 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  11. Lasserre, J.B.: A sum of squares approximation of nonnegative polynomials. SIAM J. Optim. 11, 751–765 (2001)

    Article  Google Scholar 

  12. Lasserre, J.B., Netzer, T.: SOS approximations of nonnegative polynomials via simple high degree perturbations. Math. Z. 256, 99–112 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  13. Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Putinar, M., Sullivant, S. (eds.) IMA Volume Emerging Applications of Algebraic Geometry, pp. 157–270. Springer, Berlin (2009)

    Chapter  Google Scholar 

  14. Löfberg, J., Parrilo, P.A.: From coefficients to samples: a new approach to SOS optimization. In: Proceeding of IEEE Conference on Decision and Control (2004)

    Google Scholar 

  15. Nakata, M., Braams, B.J., Fujisawa, K., Fukuda, M., Percus, J.K., Yamashita, M., Zhao, Z.: Variational calculation of second-order reduced density matrices by strong N-representability conditions and an accurate semidefinite programming solver. J. Chem. Phys. 128(16), 164113 (2008)

    Article  Google Scholar 

  16. MATLAB Symbolic Math Toolbox: http://www.mathworks.com/products/symbolic

  17. Miyata, H., Moriyama, S., Imai, H.: Private communication (2009)

  18. Muramatsu, M.: Solving polynomial optimization via cone linear programming. ISCIE J. Syst. Control Inform., 50, 8–13 (2006) (in Japanese)

    Google Scholar 

  19. Parrilo, P.A.: Semidefinite programming relaxations for semialgebraic problems. Math. Program. 96, 293–320 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  20. Prajna, S., Papachristodoulou P. Seiler, A., Parrilo, P.A.: SOSTOOLS: sum of squares optimization toolbox for MATLAB (2004). Available from http://www.cds.caltech.edu/sostools and http://www.mit.edu/~parrilo/sostools

  21. Renegar, J.: Linear programming, complexity theory, and elementary functional analysis. Math. Program. 70(3), 279–351 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  22. Schweighofer, M.: Optimization of polynomials on compact semialgebraic sets. SIAM J. Optim. 15, 805–825 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  23. Strum, J.F.: SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11&12, 625–653 (1999). Available from http://sedumi.mcmaster.ca/

    Article  Google Scholar 

  24. 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)

    Article  MathSciNet  MATH  Google Scholar 

  25. Waki, H., Kim, S., Kojima, M., Muramatsu, M., Sugimoto, H.: SparsePOP: a sparse SDP relaxation of polynomial optimization problems (2007). Available from http://www.is.titech.ac.jp/~kojima/SparsePOP

  26. Waki, H., Muramatsu, M.: Facial reduction algorithms for conic optimization problems. Technical report CS-09-01, Dept. Computer Science, The University of Electro-Communications (2009)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Electro-Communications, 1-5-1 Chofugaoka, Chofu-shi, Tokyo, 182-8585, Japan

    Hayato Waki & Masakazu Muramatsu

  2. Advanced Center for Computing and Communication, RIKEN, 2-1 Hirosawa, Wako-shi, Saitama, 351-0198, Japan

    Maho Nakata

Authors
  1. Hayato Waki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maho Nakata
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Masakazu Muramatsu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hayato Waki.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Waki, H., Nakata, M. & Muramatsu, M. Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization. Comput Optim Appl 53, 823–844 (2012). https://doi.org/10.1007/s10589-011-9437-8

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-011-9437-8

Keywords

Search

Navigation