Polynomial Matrix Inequality and Semidefinite Representation

References

• Ahmadi A. A., Parrilo P. A. A convex polynomial that is not sos-convex. (2009) . Preprint, http://arxiv.org/abs/0903.1287Google Scholar
• Ben-Tal A., Nemirovski A.Lectures on Modern Convex Optim.: Anal., Algorithms, Engrg. Appl. (2001) (SIAM, Philadelphia) MPS-SIAM Series on OptimizationCrossref, Google Scholar
• Choi M. D. Positive semidefinite biquadratic forms. Linear Algebra Appl. (1975) 12:95–100Crossref, Google Scholar
• Choi M. D., Lam T.-Y., Reznick B. Real zeros of positive semidefinite forms. I. Math. Z. (1980) 171(1):1–26Crossref, Google Scholar
• Helton J. W., Nie J. Structured semidefinite representation of some convex sets. Proc. 47th IEEE Conf. Decision and Control (2008) Washington, DC:4797–4800Google Scholar
• Helton J. W., Nie J. Sufficient and necessary conditions for semidefinite representability of convex hulls and sets. SIAM J. Optim. (2009) 20(2):759–791Crossref, Google Scholar
• Helton J. W., Nie J. Semidefinite representation of convex sets. Math. Programming, Ser. A (2010) 122(1):21–64Crossref, Google Scholar
• Helton W., Vinnikov V. Linear matrix inequality representation of sets. Comm. Pure Appl. Math. (2007) 60(5):654–674Crossref, Google Scholar
• Henrion D. On semidefinite representations of plane quartics. (2008) . LAAS-CNRS Research Report 08444, Toulouse, FranceGoogle Scholar
• Henrion D., Lasserre J. Convergent relaxations of polynomial matrix inequalities and static output feedback. IEEE Trans. Automatic Control (2006) 51:192–202Crossref, Google Scholar
• Lasserre J. Convex sets with semidefinite representation. Math. Programming (2009) 120(2):457–477Crossref, Google Scholar
• Lasserre J. Convexity in semi-algebraic geometry and polynomial optimization. SIAM J. Optim. (2009) 19(4):1995–2014Crossref, Google Scholar
• Laurent M. Semidefinite representations for finite varieties. Math. Programming, Ser. A (2007) 109(1):1–26Crossref, Google Scholar
• Ling C., Nie J., Qi L., Ye Y. Bi-quadratic optimization over unit spheres and semidefinite programming relaxations. SIAM J. Optim. (2009) 20(3):1286–1310Crossref, Google Scholar
• Löfberg J. YALMIP: A toolbox for modeling and optimization in Matlab. Proc. IEEE CACSD Sympos. (2004) Taiwan, Republic of China www.control.isy.liu.se/∼johanlGoogle Scholar
• Nemirovskii A. Advances in convex optimization: Conic programming. Plenary Lecture, Internat. Congress of Mathematicians (ICM) (2006) Madrid, SpainGoogle Scholar
• Nesterov Y., Nemirovskii A. Interior-point polynomial algorithms in convex programming. SIAM Studies in Applied Mathematics (1994) 13(Society for Industrial and Applied Mathematics (SIAM), Philadelphia) Crossref, Google Scholar
• Nie J. First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials. Math. Programming (2011) . ForthcomingGoogle Scholar
• Nie J., Sturmfels B. Matrix cubes parametrized by eigenvalues. SIAM J. Matrix Anal. Appl. (2009) 31(2):755–766Crossref, Google Scholar
• Parrilo P. Exact semidefinite representation for genus zero curves. Banff Workshop on Positive Polynomials Optimization (2006) Banff, Alberta, CanadaGoogle Scholar
• Putinar M. Positive polynomials on compact semi-algebraic sets. Indiana Univ. Math. J. (1993) 42:203–206Crossref, Google Scholar
• Shapiro A. First and second order analysis of nonlinear semidefinite programs. Math. Programming, Ser. B (1997) 77(2):301–320Google Scholar
• Vandenberghe L., Boyd S. Semidefinite programming. SIAM Rev. (1996) 38:49–95Crossref, Google Scholar
• Wolkowicz H., Saigal R., Vandenberghe L.Handbook of Semidefinite Programming (2000) (Kluwer Academic Publisher, Boston) Crossref, Google Scholar