Abstract. Let F be a compact subset of the n-dimensional Euclidean space R
|
782
|
Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics 2. SpringerVerlag
– Grötschel, Lovász, et al.
- 1988
|
|
574
|
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
– Goemans, Williamson
- 1995
|
|
422
|
Semidefinite Programming
– Vandenberghe, Boyd
- 1996
|
|
405
|
Interior point methods in semidefinite programming with applications to combinatorial optimization
– Alizadeh
- 1995
|
|
391
|
The Linear Complementarity Problem
– Cottle, Pang, et al.
- 1992
|
|
157
|
A lift-and-project cutting plane algorithm for mixed 0-1 programs
– Balas, Ceria, et al.
- 1993
|
|
72
|
Semidefinite relaxation and nonconvex quadratic optimization
– Nesterov
- 1998
|
|
52
|
A recipe for semidefinite relaxation for (0; 1)-quadratic programming
– POLJAK, RENDL, et al.
- 1995
|
|
37
|
An Algorithmic Analysis of Multiquadratic and Semidefinite Programming Problems
– RAMANA
- 1993
|
|
33
|
Cones of matrices and set functions and 0-1 optimization
– Lov'asz, Schrijver
- 1991
|
|
32
|
Quadratic optimization problems
– SHOR
- 1987
|
|
29
|
A new reformulation-linearization technique for bilinear programming problems
– Sherali, Alameddine
- 1992
|
|
26
|
Control system synthesis via bilinear matrix inequalities
– Safonov, Goh, et al.
- 1994
|
|
26
|
Dual Quadratic Estimates in Polynomial and Boolean Programming
– SHOR
- 1990
|
|
24
|
Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization problems
– KOJIMA, TUNC, et al.
- 1998
|
|
24
|
A reformulation-convexification approach for solving nonconvex quadratic programming problems
– Sherali, Tuncbilek
- 1995
|
|
22
|
Convexity and Optimization
– Stoer, Witzgall
- 1970
|
|
20
|
On a representation of the matching polytope via semidefinite liftings
– Stephen, Tunçel
- 1999
|
|
18
|
On the generic properties of convex optimization problems in conic form
– Pataki, Tuncel
- 1997
|
|
17
|
Semidefinite relaxation for nonconvex programs
– Fujie, Kojima
- 1997
|
|
17
|
Approximating quadratic programming with quadratic constraints," Working Paper
– Ye
- 1997
|
|
14
|
Towards the Implementation of Successive Convex Relaxation Method for Nonconvex Quadratic Optimization Problems
– Takeda, Dai, et al.
- 1999
|
|
12
|
A cone programming approach to the bilinear matrix inequality problem and its geometry," Mathematical Programming 77
– Mesbahi, Papavassilopoulos
- 1997
|
|
6
|
The directions of the line segments and of the r\Gammadimensional balls on the boundary of a convex body in Euclidean space
– Ewald, Larman, et al.
- 1970
|
|
4
|
Goemans, "Semidefinite programming in combinatorial optimization
– X
- 1997
|
|
3
|
Complexity Analysis of Conceptual Successive Convex Relaxation of Nonconvex Sets
– Kojima, Takeda
- 1999
|
|
