In this paper we investigate matrix inequalities which hold irrespective of the size of the matrices involved, and explain how the search for such inequalities can be implemented as a semidefinite program (SDP). We provide a comprehensive discussion of the time complexity of these SDPs

Angelika Wiegele

Igor Klep

Janez Povh

Croatian Operational Research Review

English

HRČAK - Portal of Croatian Scientific and Professional Journals

Croatian Operational Research Review (CRORR), Vol. 3, 2012      126   Croatian Operational Research Review (CRORR), Vol. 3, 2012      127   Croatian Operational Research Review (CRORR), Vol. 3, 2012      128   Croatian Operational Research Review (CRORR), Vol. 3, 2012      129    Croatian Operational Research Review (CRORR), Vol. 3, 2012      130  Croatian Operational Research Review (CRORR), Vol. 3, 2012      131      Croatian Operational Research Review (CRORR), Vol. 3, 2012      132    Croatian Operational Research Review (CRORR), Vol. 3, 2012      133    Croatian Operational Research Review (CRORR), Vol. 3, 2012      134     REFERENCES  [BM03] S. Burer and R.D.C. Monteiro (2003), “A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization“, Mathematical Programming (Series B), 95, 329–357. [Bor99] B. Borchers (1999), “CSDP, a C library for semidefinite programming“ Optim. Methods Softw., 11/12(1-4), 613–623.  [BTN01] A. Ben-Tal and A. Nemirovski (2001), Lectures on modern convex optimization, MPS/SIAM Series on Optimization, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA.  Croatian Operational Research Review (CRORR), Vol. 3, 2012      135 [BV06] S. Burer and D. Vandenbussche (2006), “Solving lift-and-project relaxations of binary integer programs“, SIAM Journal on Optimization, 16(3), 726–750.  [CKP11] K. Cafuta, I. Klep, and J. Povh (2011), “NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials“,  Optimization Methods and Software, 26(3), 363–380. http://ncsostools.fis.unm.si/.   [CKP12] K. Cafuta, I. Klep, and J. Povh (2012), „Constrained polynomial optimization problems with noncommuting variables. SIAM Journal of Optimization, 22(2):363–383.  [dK02] E. de Klerk (2002), Aspects of semidefinite programming, volume 65 of Applied Optimization, Kluwer Academic Publishers, Dordrecht. [DLTW08] A.C. Doherty, Y.-C. Liang, B. Toner, and S. Wehner (2008), „The quantum moment problem and bounds on entangled multi-prover games“,  In Twenty-Third Annual IEEE Conference on Computational Complexity, 199–210,  IEEE Computer Soc., Los Alamitos, CA. [Gla63] R.J. Glauber (1963), “The quantum theory of optical coherence“, Physical Review, 130(6), 2529–2539. [Hel02] J.W. Helton (2002), “Positive noncommutative polynomials are sums of squares“, Annals of Mathematics (2), 156(2), 675–694. [HKM12] J.W. Helton, I. Klep, and S. McCullough (2012), “The convex positivstellensatz in a free algebra“,  Adv. Math., 231(1), 516–534, [HLL09] D. Henrion, J.-B. Lasserre, and J. Löfberg (2009), „GloptiPoly 3: moments, optimization and semidefinite programming“, Optim. Methods Softw., 24(4-5), 761–779. 2009.   [HM04] J.W. Helton and S.A. McCullough (2004), “A Positivstellensatz for non-commutative polynomials“,  Trans. Amer. Math. Soc., 356(9), 3721–3737. [HM12] J.W. Helton and S. McCullough (2012), „Every free basic convex semi-algebraic set has an LMI representation“,  Ann. of Math. (2), 176(2), 979–1013. [HMdOP08] J.W. Helton, S. McCullough, M.C. de Oliveira, and M. Putinar (2008), „Engineering systems and free semi-algebraic geometry“, In Emerging Applications of Algebraic Geometry, volume 149 of IMA Vol. Math. Appl., pages 17–62. Springer. [HR00] C. Helmberg and F. Rendl (2000), “A spectral bundle method for semidefinite programming“,  SIAM Journal on Optimization, 10(3), 673–696. [JR08] F. Jarre and F. Rendl (2008), “An augmented primal-dual method for linear conic problems“,  SIAM Journal on Optimization. [KP10] I. Klep and J. Povh (2010), “Semidefinite programming and sums of hermitian squares of noncommutative polynomials“,  Journal of Pure and Applied Algebra, 214, 740–749. [KS07] I. Klep and M. Schweighofer (2007), “A nichtnegativstellensatz for polynomials in noncommuting variables“,  Israel Jornal of  Mathematics, 161, 17–27. [Löf04] J. Löfberg (2004), “YALMIP: A toolbox for modeling and optimization in MATLAB“, In Proceedings of the CACSD Conference, Taipei, Taiwan.  [Maz04] D.A. Mazziotti (2004), “Realization of quantum chemistry without wave functions through first-order semidefinite programming“,  Physical Review  Letters, 93(21), 213001. [Mit03] D. Mittelmann (2003), “An independent benchmarking of SDP and SOCP solvers“,  Mathematical Programming,  B, 95, 407–430. Croatian Operational Research Review (CRORR), Vol. 3, 2012      136[MPRW09] J. Malick, J. Povh, F. Rendl, and A. Wiegele (2009), “Regularization methods for semidefinite programming“,  SIAM Journal of Optimization, 20(1), 336–356. [Nem07] A. Nemirovski (2007), “Advances in convex optimization: conic programming“. In International Congress of Mathematicians. Vol. I, pages 413–444. Eur. Math. Soc., Zurich. [NT08] A. S. Nemirovski and M. J. Todd (2008), “Interior-point methods for optimization“, Acta Numer., 17, 191–234. [PNA10] S. Pironio, M. Navascues, and A. Acın (2010), “Convergent relaxations of polynomial optimization problems with noncommuting variables“,  SIAM Journal of Optimization, 20(5), 2157–2180. [PPSP05] S. Prajna, A. Papachristodoulou, P. Seiler, and P.A. Parrilo (2005), “SOSTOOLS and its control applications. In Positive polynomials in control, volume 312 of Lecture Notes in Control and Inform. Sci., 273–292, Springer, Berlin. [PS01] V. Powers and C. Scheiderer (2001), “The moment problem for non-compact semialgebraic sets“,  Adv. Geom., 1(1), 71–88. [PV09] K.F. Pal and T. Vertesi (2009), “Quantum bounds on Bell inequalities“, Phys. Rev. A (3), 79(2), 022120, 12. [Stu99] J.F. Sturm (1999), “Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones“,  Optiization Methods and Software, 11/12(1-4), 625–653.   [TTT] K.-C. Toh, M.J. Todd, and R.-H. Tutuncu. “SDPT3 version 4.0 (beta) – aMATLAB software for semidefinite-quadratic-linear programming“,  http://www.math.nus.edu.sg/~mattohkc/sdpt3.html.   [VB96] L. Vandenberghe and S. Boyd (1996), “Semidefinite programming“, SIAM Rev., 38(1), 49–95.   [WGY10] Z. Wen, D. Goldfarb, and W. Yin (2010), “Alternating direction augmented lagrangian methods for semidefinite programming“, Math. Prog. Comp., 2, 203–230. [WKK+09] H. Waki, S. Kim, M. Kojima, M. Muramatsu, and H. Sugimoto (2009), “Algorithm 883: sparsePOP—a sparse semidefinite programming relaxation of polynomial optimization problems“ ACM Trans. Math. Software, 35(2), Art. 15, 13. [WSV00] H. Wolkowicz, R. Saigal, and L. Vandenberghe (2000), Handbook of Semidefinite Programming, Kluwer. [ZST08] X. Zhao, D. Sun, and K. Toh (2008), “A Newton-CG augmented Lagrangian method for semidefinite programming“,  Technical Report, National University of Singapore.    

ON THE COMPLEXITY OF SEMIDEFINITE PROGRAMS ARISING IN POLYNOMIAL OPTIMIZATION

Abstract

Similar works

Full text

Available Versions

HRČAK - Portal of Croatian Scientific and Professional Journals

Directory of Open Access Journals