Semidefinite programming and sums of hermitian squares of noncommutative polynomials

Journal of Pure and Applied Algebra

Volumn 214, Issue 6, 2010, Pages 740-749

  Klep, Igor ^a,b   Povh, Janez ^c  

^a UNIVERSITY OF LJUBLJANA   (Slovenia)

^b UNIVERSITY OF MARIBOR   (Slovenia)

^c INSTITUTE OF MATHEMATICS   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 74149090510     PISSN: 00224049     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpaa.2009.07.003     Document Type: Article

References (31)

1. Helton J.W. Positive noncommutative polynomials are sums of squares. Ann. of Math. (2) 156 2 (2002) 675-694
2. McCullough S., and Putinar M. Noncommutative sums of squares. Pacific J. Math. 218 1 (2005) 167-171
3. de Oliveira M.C., Helton J.W., McCullough S., and Putinar M. Engineering systems and free semi-algebraic geometry. Emerging Applications of Algebraic Geometry. IMA Vol. Math. Appl. vol. 149 (2008), Springer 17-62
4. Klep I., and Schweighofer M. Connes' embedding conjecture and sums of Hermitian squares. Adv. Math. 217 4 (2008) 1816-1837
5. Klep I., and Schweighofer M. Sums of Hermitian squares and the BMV conjecture. J. Statist. Phys 133 4 (2008) 739-760
6. Choi M.D., Lam T.Y., and Reznick B. Sums of squares of real polynomials. K-Theory and Algebraic Geometry: Connections with Quadratic Forms and Division Algebras. (Santa Barbara, CA, 1992). Proc. Sympos. Pure Math. vol. 58 (1995), Amer. Math. Soc, Providence, RI 103-126
7. Parrilo P.A. Semidefinite programming relaxations for semialgebraic problems. Math. Program. 96 2, Ser. B (2003) 293-320
8. I. Pólik, T. Terlaky, New stopping criteria for detecting infeasibility in conic optimization, AdvOL-report #2007/09, 2007
9. Rowen L.H. Polynomial Identities in Ring Theory. Pure and Applied Mathematics vol. 84 (1980), Academic Press Inc., New York
10. Basu S., Pollack R., and Roy M.-F. Algorithms in Real Algebraic Geometry. Algorithms and Computation in Mathematics vol. 10 (2006), Springer-Verlag, Berlin. http://perso.univ-rennes1.fr/marie-francoise.roy/bpr-posted1.html Available from http://perso.univ-rennes1.fr/marie-francoise.roy/bpr-posted1.html
11. Wolkowicz H., Saigal R., and Vandenberghe L. Handbook of Semidefinite Programming (2000), Kluwer
12. Prajna S., Papachristodoulou A., Seiler P., and Parrilo P.A. SOSTOOLS and its control applications. Positive Polynomials in Control. Lecture Notes in Control and Inform. Sci. vol. 312 (2005), Springer, Berlin 273-292
13. Ramana M.V. An exact duality theory for semidefinite programming and its complexity implications. Math. Program. 77 2, Ser. B (1997) 129-162
14. Ben-Tal A., and Nemirovski A. Lectures on modern convex optimization. Analysis, Algorithms, and Engineering Applications. MPS/SIAM Series on Optimization (2001), Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA
15. Malick J., Povh J., Rendl F., and Wiegele A. Regularization methods for semi-definite programming. SIAM J. Optim. 20 1 (2009) 336-356
16. Povh J., Rendl F., and Wiegele A. A boundary point method to solve semidefinite programs. Computing 78 (2006) 277-286
17. H. Mittelman, http://plato.asu.edu/sub/pns.html, 1 March 2009
18. Reznick B. Extremal PSD forms with few terms. Duke Math. J. 45 2 (1978) 363-374
19. B. Recht, M. Fazel, P.A. Parrilo, Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. Available from http://arxiv.org/abs/0706.4138. 2007
20. Todd M.J. Semidefinite optimization. Acta Numer. 10 (2001) 515-560
21. SeDuMi, http://sedumi.ie.lehigh.edu/. 1 March 2009
22. K.-C. Toh, M.J. Todd, R.-H. Tütüncü, SDPT3 version 4.0 (beta) - a MATLAB software for semidefinite-quadratic-linear programming. Available from http://www.math.nus.edu.sg/~mattohkc/sdpt3.html, 1 March 2009
23. de Klerk E., Roos C., and Terlaky T. Infeasible-start semidefinite programming algorithms via self-dual embeddings. Topics in Semidefinite and Interior-point Methods. (Toronto, ON, 1996). Fields Inst. Commun. vol. 18 (1998), Amer. Math. Soc, Providence, RI 215-236
24. Porkolab L., and Khachiyan L. On the complexity of semidefinite programs. J. Global Optim. 10 4 (1997) 351-365
25. K. Cafuta, I. Klep, J. Povh, NCSOStools: A computer algebra system for symbolic and numerical computation with noncommutative polynomials. Available from http://ncsostools.fis.unm.si/downloads/ncsostools_manual.pdf, 6 March 2009
26. SOSTools, http://www.cds.caltech.edu/sostools/. 1 March 2009
27. Powers V., and Wörmann T. An algorithm for sums of squares of real polynomials. J. Pure Appl. Algebra 127 1 (1998) 99-104
28. D. Henrion, J.-B. Lasserre, J. Löfberg, GloptiPoly 3: Moments, optimization and semidefinite programming. Available from http://www.laas.fr/~henrion/software/gloptipoly3/. 1 March 2009
29. YALMIP, http://control.ee.ethz.ch/~joloef/wiki/pmwiki.php. 1 March 2009
30. J. Löfberg, YALMIP: A toolbox for modeling and optimization in MATLAB, in: Proceedings of the CACSD Conference, Taipei, Taiwan, 2004
31. Waki H., Kim S., Kojima M., and Muramatsu M. Sums of squares and semidefinite program relaxations for polynomial optimization problems with structured sparsity. SIAM J. Optim. 17 1 (2006) 218-242 (electronic)