|
157
|
A lift-and-project cutting plane algorithm for mixed 0-1 programs
– Balas, Ceria, et al.
- 1993
|
|
150
|
Primal-dual interior-point methods for self-scaled cones
– NESTEROV, TODD
- 1998
|
|
134
|
Self-scaled barriers and interiorpoint methods for convex programming
– NESTEROV, TODD
- 1997
|
|
117
|
Varieties and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra
– COX, LITTLE, et al.
- 1991
|
|
93
|
A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems
– Sherali, Adams
- 1990
|
|
69
|
Semidefinite programming relaxations for semi-algebraic problems
– Parrilo
|
|
53
|
S-procedure in nonlinear control theory
– Yakubovich
- 1971
|
|
39
|
A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, volume 31 of Nonconvex Optimization and Its Applications
– Sherali, Adams
- 1999
|
|
35
|
A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for 0-1 programming
– Laurent
|
|
23
|
of global minimum bounds for polynomial functions
– SHOR
|
|
19
|
Approximation of the stability number of a graph via copositive programming
– Klerk, Pasechnik
|
|
17
|
Cones of matrices and set-functions and 0-1 optimization
– ASZ, SCHRIJVER
- 1991
|
|
14
|
Positive Polynomials : from Hilbert’s 17th problem to real algebra
– Prestel, Delzell
- 2001
|
|
13
|
A general framework for convex relaxation of polynomial optimization problems over cones
– Kojima, Kim, et al.
- 2003
|
|
13
|
On cones of nonnegative quadratic functions
– Sturm, Zhang
- 2003
|
|
10
|
Lift-and-Project Methods for Mixed 0-1 Programs
– Ceria
- 1993
|
|
9
|
Bounds on measures satisfying moment conditions
– Lasserre
|
|
9
|
Structure of non-negative polynomials and optimization problems
– Nesterov
- 1997
|
|
8
|
Minimizing polynomial functions. In Algorithmic and quantitative real algebraic geometry, volume 60 of DIMACS series in discrete mathematics and theoretical computer science
– Parrilo, Sturmfels
- 2003
|
|
7
|
Representing polynomials by positive linear functions on compact convex polyhedra
– Handelman
- 1988
|
|
5
|
Structured semide programs and semialgebraic geometry methods in robustness and optimization
– Parrilo
- 2000
|
|
3
|
Global Optimization Problems with Polynomials and the Problem of Moments
– Lasserre
- 2001
|
|
2
|
lift-and-project cutting planes for mixed 0-1 semide programming, working paper
– Iyengar, Cezik
- 2001
|
|
2
|
An explicit equivalent positive semide program for nonlinear 0-1 programs
– Lasserre
- 2001
|
|
1
|
The use of a modi of the ralgorithm for the global minimum of polynomial functions, Cybernet. Systems Anal
– Shor, Stetsyuk
- 1997
|
|
1
|
Sahinidis, Convexi and Global Optimization
– Tawarmalani, V
- 2002
|
|
1
|
LMI approximations for cones of positive semide forms, submitted to
– Zuluaga, Vera, et al.
|
|
