Fetching the paper…
Reading the bibliography…
It is known that one can solve semidefinite programs to within fixed accuracy in polynomial time using the ellipsoid method (under some assumptions).
D. Yudin and A.S. Nemirovski, Informational complexity and effective methods of solution of convex extremal problems
1976
Earlier work this paper cites.
L. Khachiyan. A polynomial time algorithm in linear programming
1979
Earlier work this paper cites.
M. Grötschel, L. Lovász, and A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization
1981
Earlier work this paper cites.
N.K. Karmarkar, A new polynomial–time algorithm for linear programming
1984
Earlier work this paper cites.
M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization
1988
Earlier work this paper cites.
Yu. Nesterov and A.S. Nemirovski, Interior point polynomial algorithms in convex programming
1994
Earlier work this paper cites.
M.X. Goemans and D.P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
1995
Earlier work this paper cites.
J.R. Vera, Ill-Posedness and Finite Precision Arithmetic: A Complexity Analysis for Interior Point Methods
1997
Cited alongside, same era.
S.J. Wright, Primal–dual interior point methods
1997
Cited alongside, same era.
A. Schrijver, Theory of Linear and Integer Programming
1998
Cited alongside, same era.
M. Gu, Primal-dual interior-point methods for semidefinite programming in finite precision
2000
Cited alongside, same era.
R.D.C. Monteiro and M.J. Todd, Path-following methods
2000
Cited alongside, same era.
J. Renegar, A Mathematical View of Interior-Point Methods in Convex Optimization
2001
Cited alongside, same era.
A. Schrijver, New code upper bounds from the Terwilliger algebra
2005
Later among the works it cites.
E. de Klerk, D.V. Pasechnik, A. Schrijver. Reduction of symmetric semidefinite programs using the regular *-representation
2007
Later among the works it cites.
H.D. Mittelmann and F. Vallentin, High accuracy semidefinite programming bounds for kissing numbers
2010
Later among the works it cites.
B. Gärtner and J. Matoušek, Approximation Algorithms and Semidefinite Programming
2012
Later among the works it cites.
M. Yamashita, K. Fujisawa, M. Fukuda, K. Kobayashi, K. Nakata, and M. Nakata, Latest developments in the SDPA family for solving large-scale SDPs
2012
Later among the works it cites.
D. de Laat, F.M. de Oliveira Filho, and F. Vallentin, Upper bounds for packings of spheres of several radii
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S.J. Wright, Effects of Finite-Precision Arithmetic on Interior-Point Methods for Nonlinear Programming
2001
Cited alongside, same era.
2014
Later among the works it cites.