Positive Polynomials and Projections of Spectrahedra
暂无分享,去创建一个
[1] Tim Netzer,et al. EXPOSED FACES OF SEMIDEFINITE REPRESENTABLE SETS , 2009 .
[2] Petter Brändén. Obstructions to determinantal representability , 2011 .
[3] J. William Helton,et al. The matricial relaxation of a linear matrix inequality , 2010, Math. Program..
[4] Claus Scheiderer. Convex hulls of curves of genus one , 2010 .
[5] Arkadi Nemirovski,et al. Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.
[6] Claus Scheiderer,et al. Sums of squares of regular functions on real algebraic varieties , 2000 .
[7] T. Jacobi. A representation theorem for certain partially ordered commutative rings , 2001 .
[8] Didier Henrion,et al. Semidefinite Representation of Convex Hulls of Rational Varieties , 2009, ArXiv.
[9] Rekha R. Thomas,et al. Theta Bodies for Polynomial Ideals , 2008, SIAM J. Optim..
[10] W. Fulton,et al. Algebraic Curves: An Introduction to Algebraic Geometry , 1969 .
[11] Claus Scheiderer,et al. Non-existence of degree bounds for weighted sums of squares representations , 2005, J. Complex..
[12] Pablo A. Parrilo,et al. Minimizing Polynomial Functions , 2001, Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science.
[13] Stephen P. Boyd,et al. Semidefinite Programming , 1996, SIAM Rev..
[14] W. Fulton. Algebraic curves , 1969 .
[15] A. Nemirovski. Advances in convex optimization : conic programming , 2005 .
[16] M. Marshall. Positive polynomials and sums of squares , 2008 .
[17] A. Lewis,et al. The lax conjecture is true , 2003, math/0304104.
[18] Charles N. Delzell,et al. Positive Polynomials on Semialgebraic Sets , 2001 .
[19] Igor Klep,et al. Infeasibility certificates for linear matrix inequalities , 2011 .
[20] K. Ueno. An Introduction to Algebraic Geometry , 1997 .
[21] J. William Helton,et al. Semidefinite representation of convex sets , 2007, Math. Program..
[22] Yurii Nesterov,et al. Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.
[23] Jean B. Lasserre,et al. Convex sets with semidefinite representation , 2009, Math. Program..
[24] J. Helton,et al. Linear matrix inequality representation of sets , 2003, math/0306180.
[25] Aharon Ben-Tal,et al. Lectures on modern convex optimization , 1987 .
[26] Rainer Sinn,et al. A Note on the Convex Hull of Finitely Many Projections of Spectrahedra , 2009 .
[27] Henry Wolkowicz,et al. Handbook of Semidefinite Programming , 2000 .
[28] P. H. Diananda. On non-negative forms in real variables some or all of which are non-negative , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.
[29] Salma Kuhlmann,et al. Positivity, sums of squares and the multi-dimensional moment problem II ⁄ , 2005 .
[30] J. William Helton,et al. Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets , 2007, SIAM J. Optim..
[31] A. J. Goldman,et al. Some geometric results in semidefinite programming , 1995, J. Glob. Optim..
[32] Salma Kuhlmann,et al. Positivity, sums of squares and the multi-dimensional moment problem , 2002 .
[33] D. Henrion. On semidefinite representations of plane quartics , 2008, 0809.1826.
[34] Markus Schweighofer,et al. Exposed Faces of Semidefinitely Representable Sets , 2010, SIAM J. Optim..
[35] Bernd Sturmfels,et al. The Convex Hull of a Variety , 2010, ArXiv.