Interior point polynomial methods in convex programming
Y. E. Nesterov and A. Nemirovski · 1994
Cited alongside, same era.
Cones of matrices and successive convex relaxations of nonconvex sets
Masakazu Kojima and Levent Tunçel · 2000
Cited alongside, same era.
Lectures on modern convex optimization
A. Ben-Tal and A. Nemirovski · 2001
Cited alongside, same era.
On polyhedral approximations of the second-order cone
Aharon Ben-Tal and Arkadi Nemirovski · 2001
Cited alongside, same era.
Global optimization with polynomials and the problem of moments
Jean B. Lasserre · 2001
Cited alongside, same era.
A course in convexity
Alexander Barvinok · 2002
Cited alongside, same era.
Semidefinite programming relaxations for semialgebraic problems
Pablo A. Parrilo · 2003
Cited alongside, same era.
Subset algebra lift operators for 0-1 integer programming
Daniel Bienstock and Mark Zuckerberg · 2004
Cited alongside, same era.
Approximations of convex bodies by polytopes and by projections of spectrahedra
Original
A. Barvinok
Cited in the paper.
Combinatorial bounds on nonnegative rank and extended formulations
Original
Samuel Fiorini, Volker Kaibel, Kanstantsin Pashkovich, and Dirk O. Theis
Cited in the paper.
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds
Original
Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, and Ronald de Wolf
Cited in the paper.
On the geometric interpretation of the nonnegative rank
Original
Nicolas Gillis and Francois Glineur
Cited in the paper.