Fetching the paper…
Reading the bibliography…
For a semialgebraic set K in R^n, let P_d(K) be the cone of polynomials in R^n of degrees at most d that are nonnegative on K.
P. Diananda. On non-negative forms in real variables some or all of which are non-negative. Proc. Cambridge Philos. Soc
1962
Earlier work this paper cites.
E. Looijenga. Isolated singular points on complete intersections
1984
Earlier work this paper cites.
K. Schmüdgen. The K-moment problem for compact semialgebraic sets. Math. Ann
1991
Earlier work this paper cites.
J. Harris. Algebraic Geometry, A First Course
1992
Earlier work this paper cites.
M. Putinar. Positive polynomials on compact semi-algebraic sets, Ind. Univ. Math. J
1993
Earlier work this paper cites.
I. Gel’fand, M. Kapranov, and A. Zelevinsky. Discriminants, resultants, and multidimensional determinants
1994
Earlier work this paper cites.
D. Bertsekas. Nonlinear Programming
1995
Earlier work this paper cites.
D. Cox, J. Little and D. O’Shea. Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
1997
Earlier work this paper cites.
D. Cox, J. Little and D. O’Shea. Using algebraic geometry
1998
Cited alongside, same era.
B. Reznick. Some concrete aspects of Hilberts 17th problem. Contemp. Math
2000
Cited alongside, same era.
J. B. Lasserre. Global optimization with polynomials and the problem of moments. SIAM J. Optim
2001
Cited alongside, same era.
B. Sturmfels. Solving systems of polynomial equations
2002
Cited alongside, same era.
P. Parrilo. Semidefinite programming relaxations for semialgebraic problems. Math. Prog
2003
Cited alongside, same era.
P. A. Parrilo and B. Sturmfels. Minimizing polynomial functions. In S. Basu and L. Gonzalez-Vega, editors, Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science, volume 60 of DIMACS Series in Discrete Mathematics and Computer Science
J. Nie, J. Demmel and B. Sturmfels. Minimizing polynomials via sum of squares over the gradient ideal. Math. Prog
2006
Later among the works it cites.
J. Nie, P. Parrilo and B. Sturmfels. Semidefinite Representation of the k-Ellipse. IMA Volume 146: Algorithms in Algebraic Geometry
2008
Later among the works it cites.
J. Gouveia, P.A. Parrilo, and R. Thomas. Theta Bodies for Polynomial Ideals. SIAM J. Optim
2009
Later among the works it cites.
2009
Later among the works it cites.
J. Nie and K. Ranestad. Algebraic degree of polynomial optimization. SIAM J. Optim
2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2003
Cited alongside, same era.
J. Löfberg. YALMIP: a toolbox for modeling and optimization in Matlab. Proc. IEEE CACSD Symposium
2004
Cited alongside, same era.
F. Catanese, S. Hoşten, A. Khetan and B. Sturmfels. The maximum likelihood degree. American Journal of Mathematics
2006
Cited alongside, same era.
G.-M. Greuel, G. Pfister and H. Schoenemann. SINGULAR: A Computer Algebra System for Polynomial Computations
Cited in the paper.
D. Henrion, J. Lasserre and J. Loefberg. GloptiPoly 3: moments, optimization and semidefinite programming
Cited in the paper.
Cited in the paper.
R. Sanyal. F. Sottile, and B. Sturmfels. Orbitopes. Submitted to Mathematika
Cited in the paper.
J. Nie and B. Sturmfels. Matrix cubes parametrized by eigenvalues. SIAM Journal on Matrix Analysis and Applications
2009
Later among the works it cites.
K. Ranestad and H.C. Graf von Bothmer. A general formula for the algebraic degree in semidefinite programming. Bulletin of LMS
2009
Later among the works it cites.
J. Nie, K. Ranestad and B. Sturmfels. The algebraic degree of semidefinite programming. Mathematical Programming
2010
Closest in time.