Fetching the paper…
Reading the bibliography…
Consider a convex set S defined by a matrix inequality of polynomials or rational functions over a domain.
M.-D. Choi. Positive semidefinite biquadratic forms. Linear Algebra and Applications
1975
Earlier work this paper cites.
M. D. Choi, T.-Y. Lam, and B. Reznick. Real zeros of positive semidefinite forms. I. Math. Z
1980
Earlier work this paper cites.
M. Putinar. Positive polynomials on compact semi-algebraic sets, Ind. Univ. Math. J
1993
Earlier work this paper cites.
Y. Nesterov and A. Nemirovskii. Interior-point polynomial algorithms in convex programming. SIAM Studies in Applied Mathematics, 13. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1994
1994
Earlier work this paper cites.
L. Vandenberghe and S. Boyd. Semidefinite programming. SIAM Review
1996
Earlier work this paper cites.
A. Shapiro. First and second order analysis of nonlinear semidefinite programs. Mathematical Programming
1997
Earlier work this paper cites.
H. Wolkowicz, R. Saigal, and L. Vandenberghe, editors. Handbook of semidefinite programming
2000
Earlier work this paper cites.
A. Ben-Tal and A. Nemirovski. Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications
2001
Earlier work this paper cites.
J. Löfberg. YALMIP: a toolbox for modeling and optimization in Matlab. Proc. IEEE CACSD Symposium
2004
Cited alongside, same era.
D. Henrion and J. Lasserre. Convergent relaxations of polynomial matrix inequalities and static output feedback. IEEE Trans. Auto. Control
2006
Cited alongside, same era.
A. Nemirovskii. Advances in convex optimization: conic programming. Plenary Lecture, International Congress of Mathematicians (ICM)
2006
Cited alongside, same era.
P. Parrilo. Exact semidefinite representation for genus zero curves. Talk at the Banff workshop “Positive Polynomials and Optimization”, Banff, Canada, October 8-12, 2006
2006
Cited alongside, same era.
W. Helton and V. Vinnikov. Linear matrix inequality representation of sets. Comm. Pure Appl. Math
2007
Cited alongside, same era.
A. A. Ahmadi and P.A. Parrilo. A convex polynomial that is not sos-convex. Preprint
2009
Closest in time.
J.W. Helton and J. Nie. Sufficient and necessary conditions for semidefinite representability of convex hulls and sets. SIAM Journal on Optimization
2009
Closest in time.
J. Lasserre. Convex sets with semidefinite representation. Mathematical Programming
2009
Closest in time.
J. Lasserre. Convexity in semi-algebraic geometry and polynomial optimization. SIAM Journal on Optimization
2009
Closest in time.
C. Ling, J. Nie, L. Qi, and Y. Ye. Bi-quadratic optimization over unit spheres and semidefinite programming relaxations. SIAM Journal on Optimization
2009
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Laurent. Semidefinite representations for finite varieties. Math. Program
2007
Cited alongside, same era.
J.W. Helton and J. Nie. Structured semidefinite representation of some convex sets. Proceedings of 47th IEEE Conference on Decision and Control
2008
Cited alongside, same era.
D. Henrion. On semidefinite representations of plane quartics. LAAS-CNRS Research Report No. 08444, September 2008
2008
Cited alongside, same era.
J. Nie. First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials. Mathematical Programming
Cited in the paper.
J. Nie and B. Sturmfels. Matrix cubes parametrized by eigenvalues. SIAM Journal on Matrix Analysis and Applications
2009
Closest in time.
J.W. Helton and J. Nie. Semidefinite representation of convex sets. Mathematical Programming
2010
Closest in time.