Name
Abstract | ||
|---|---|---|
Let F be a subset of the n-dimensional Euclidean space Rn represented in terms of a compact convex subset of Rn and a set of finitely or infinitely many quadratic inequalities. This paper investigates some fundamental properties related to the finite convergence of the successive semidefinite programming relaxation method proposed by the authors for approximating the convex hull of F. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0377-2217(02)00298-9 | European Journal of Operational Research |
Keywords | Field | DocType |
Semidefinite programming relaxation,Nonconvex quadratic program,Complexity theory,Global optimization,Lift-and-project procedure | Orthogonal convex hull,Second-order cone programming,Discrete mathematics,Mathematical optimization,Combinatorics,Convex body,Convex hull,Convex set,Conic optimization,Convex optimization,Mathematics,Semidefinite programming | Journal |
Volume | Issue | ISSN |
143 | 2 | 0377-2217 |
Citations | PageRank | References |
8 | 0.84 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Masakazu Kojima | 1 | 1603 | 222.51 |
| Levent Tunçel | 2 | 429 | 72.12 |