On the finite convergence of successive SDP relaxation methods

European Journal of Operational Research

Volumn 143, Issue 2, 2002, Pages 325-341

  Kojima, Masakazu ^a   Tunçel, Levent ^b  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Complexity theory; Global optimization; Lift and project procedure; Nonconvex quadratic program; Semidefinite programming relaxation

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; MATHEMATICAL PROGRAMMING; OPTIMIZATION; RELAXATION PROCESSES; SET THEORY;

SEMIDEFINITE PROGRAMMING (SDP);

OPERATIONS RESEARCH;

EID: 0036883726     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00298-9     Document Type: Conference Paper

References (11)

1. The directions of the line segments and of the r-dimensional balls on the boundary of a convex body in Euclidean space
2. Semidefinite relaxation of nonconvex programs
3. Complexity analysis of successive convex relaxation methods for nonconvex sets
4. Cones of matrices and successive convex relaxations of nonconvex sets
5. Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization problems
6. Cones of matrices and set functions and 0-1 optimization
7. The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
8. A new reformulation-linearization technique for bilinear programming problems
9. A reformulation-convexification approach for solving nonconvex quadratic programming problems
10. Towards implementations of successive convex relaxation methods for nonconvex quadratic optimization problems