Fetching the paper…
Reading the bibliography…
Convex algebraic geometry concerns the interplay between optimization theory and real algebraic geometry.
R.T. Rockefeller: Convex Analysis
1970
Earlier work this paper cites.
N. Go and H.A. Scheraga: Ring closure in chain molecules with C n C_{n} , I I , and S 2 n S_{2n} symmetry, Macromolecules
1973
Earlier work this paper cites.
J. Bochnak, M. Coste, M.-F. Roy: Géométrie Algébrique Réelle
1987
Earlier work this paper cites.
D. G. Luenberger: A double look at duality, IEEE Trans. Automat. Control
1992
Earlier work this paper cites.
I. Gelfand, M. Kapranov and A. Zelevinsky: Discriminants, Resultants and Multidimensional Determinants
1994
Earlier work this paper cites.
M. Ramana and A.J. Goldman: Some geometric results in semidefinite programming, J. Global Optimization
1995
Earlier work this paper cites.
G. Ziegler: Lectures on Polytopes
1995
Earlier work this paper cites.
S. Boyd and L. Vandenberghe: Semidefinite programming, SIAM Review
1996
Earlier work this paper cites.
M. Laurent and S. Poljak: On the facial structure of the set of correlation matrices, SIAM J. Matrix Anal. Appl
1996
Cited alongside, same era.
M. Trott: Applying GroebnerBasis to three problems in geometry, Mathematica in Education and Research
1997
Cited alongside, same era.
J.B. Lasserre: Global optimization with polynomials and the problem of moments, SIAM J. Optimization
2001
Cited alongside, same era.
A. I. Barvinok: A Course in Convexity
2002
Cited alongside, same era.
S. Boyd and L. Vandenberghe: Convex Optimization
2004
Cited alongside, same era.
S. Basu, R. Pollack and M-F. Roy: Algorithms in Real Algebraic Geometry
2006
Cited alongside, same era.
M. Laurent, J.B. Lassarre and P. Rostalski: Semidefinite characterization and computation of zero-dimensional real radical ideals, Found. Comp. Math
2008
Later among the works it cites.
M. Marshall: Positive Polynomials and Sums of Squares
2008
Later among the works it cites.
H-C. Graf von Bothmer and K. Ranestad: A general formula for the algebraic degree in semidefinite programming, Bull. Lond. Math. Soc
2009
Later among the works it cites.
J.W. Helton, J. Nie: Semidefinite representation of convex sets. Math. Program
2010
Closest in time.
J.B. Lasserre: Moments, Positive Polynomials and their Applications
2010
Closest in time.
J. Nie, K. Ranestad and B. Sturmfels: The algebraic degree of semidefinite programming, Mathematical Programming
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Lazard, L.M. Peñaranda and S. Petitjean: Intersecting quadrics: an efficient and exact implementation, Comput. Geometry
2006
Cited alongside, same era.
D. Cox, J. Little and D. O’Shea: Ideals, Varieties and Algorithms
2007
Cited alongside, same era.
D. Grayson and M. Stillman: Macaulay2, a software system for research in algebraic geometry, Available at http://www.math.uiuc.edu/Macaulay2/
Cited in the paper.
J. Gouveia and T. Netzer: Positive polynomials and projections of spectrahedra, arXiv:0911.2750
Cited in the paper.
J. Nie: Discriminants and nonnegative polynomials, arXiv:1002.2230
Cited in the paper.
K. Ranestad and B. Sturmfels: On the convex hull of a space curve, to appear in Advances in Geometry
Cited in the paper.
2010
Closest in time.
J. Gouveia, P. Parrilo and R. Thomas: Theta bodies for polynomial ideals, SIAM J. Optim
2097
Closest in time.