Advertisement

Optimization Letters

, Volume 6, Issue 8, pp 1883–1896 | Cite as

How to generate weakly infeasible semidefinite programs via Lasserre’s relaxations for polynomial optimization

  • Hayato Waki
Original Paper

Abstract

Examples of weakly infeasible semidefinite programs (SDP) are useful to test whether SDP solvers can detect infeasibility. However, finding non trivial such examples is notoriously difficult. This note shows how to use Lasserre’s semidefinite programming relaxations for polynomial optimization in order to generate examples of weakly infeasible SDP. Such examples could be used to test whether a SDP solver can detect weak infeasibility. In addition, in this note, we generate weakly infeasible SDP from an instance of polynomial optimization with nonempty feasible region and solve them by SDP solvers. Although all semidefinite programming relaxation problems are infeasible, we observe that SDP solvers do not detect the infeasibility and that values returned by SDP solvers are equal to the optimal value of the instance due to numerical round-off errors.

Keywords

Semidefinite programming Weakly infeasible Semidefinite programming relaxation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Fujisawa, K., Fukuda, M., Kobayashi, K., Kojima, M., Nakata, K., Nakata, M., Yamashita, M.: Sdpa (semidefinite programming algorithm) user’s manual—version 7.0.5. Technical report, Department of Mathematical and Computer Sciences, Tokyo Institute of Technology. http://sdpa.indsys.chuo-u.ac.jp/sdpa/ (2008)
  2. Henrion, D., Lasserre, J.B.: Detecting global optimality and extracting solutions in Gloptipoly. pp. 293–311. Springer, Berlin (2005)Google Scholar
  3. Lasserre 2001 J.B.: Global optimization with polynomials and the problems of moments. SIAM J. Optim. 11, 796–817 (2001)MathSciNetzbMATHCrossRefGoogle Scholar
  4. Lasserre J.B.: A sum of squares approximation of nonnegative polynomials. SIAM J. Optim. 16, 751–765 (2006)MathSciNetzbMATHCrossRefGoogle Scholar
  5. Laurent M.: Sums of squares, moment matrices and optimization over polynomials. In: Putinar, M., Sullivant, S. Sullivant (eds) Emerging Applications of Algebraic Geometry Springer, pp. 157–270. Springer, Berlin (2009)CrossRefGoogle Scholar
  6. Mittelmann H.D. Mittelmann : An independent benchmarking of sdp and socp solvers. Math. Program. 95 95, 407–430 (2003)MathSciNetzbMATHCrossRefGoogle Scholar
  7. Pólik I., Terlaky T.: New stopping criteria for detecting infeasibility in conic optimization. Optim. Lett. 3, 187–198 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  8. Prestel A., Delzell C.N.: Positive Polynomials. Springer, Berlin (2001)zbMATHGoogle Scholar
  9. Putinar M.: Positive polynomials on compact semi-algebraic sets. Indiana Univ. Math. J. 42, 969–984 (1993)MathSciNetzbMATHCrossRefGoogle Scholar
  10. Renegar, J.: A mathematical view of interior-point methods in convex optimizaiton. In: MPS-SIAM Series on Optimization. Society for Industrial Mathematics (2001)Google Scholar
  11. Reznick, B.: Some concrete aspects of hilbert’s 17th problem. In: Delzell, C.N., Madden, J.J. (eds.) Real Algebraic Geometry and Ordered Structures, vol. 253, pp. 251–272. AMS, Dallas (2000)CrossRefGoogle Scholar
  12. Strum, J.F.: Sedumi 1.02, a matlab toolbox for optimization over symmetric cones. Opt. Meth. Software 11–12, 625–653. http://sedumi.ie.lehigh.edu/ (1999)
  13. Sturm J.F.: Theory and algorithms of semidefinite programming. In: Frenk, H., Roos, K., Terlaky, T., Zhang, S. Zhang (eds) High Performance Optimization, pp. 1–194. Kluwer Academic Publishers, Dordrecht (2000)Google Scholar
  14. Todd M.J.: Detecting infeasibility in infeasible-interior-point methods for optimization. In: Cucker, F., DeVore, R., Olver, P., Suli, E. (eds) Found. Comput. Math., pp. 157 192–192. Cambridge University Press, Cambridge (2004)Google Scholar
  15. Waki, H., Nakata, M., Muramatsu, M.: Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization. Comput. Opt. Appl. (2008, to appear)Google Scholar

Copyright information

© Springer-Verlag 2011

Authors and Affiliations

  1. 1.Department of Computer ScienceThe University of Electro-CommunicationsChofu, TokyoJapan

Personalised recommendations