On the finite convergence of successive SDP relaxation methods
type: Item
instance of: scholarly article
title: On the finite convergence of successive SDP relaxation methods
zbMATH Open document ID: 1058.90048
DOI: 10.1016/S0377-2217(02)00298-9
published in: European Journal of Operational Research
publication date: 2002-11-20T00:00:00Z
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 1832947
zbMATH Keywords: Semidefinite programming relaxation
zbMATH Keywords: Nonconvex quadratic program
zbMATH Keywords: Complexity theory
zbMATH Keywords: Global optimization
zbMATH Keywords: Lift-and-project procedure
author: Masakazu Kojima
author: Levent Tunçel
MaRDI profile type: Publication
cites work: The directions of the line segments and of the r ‐dimensional balls on the boundary of a convex body in Euclidean space
cites work: Semidefinite programming relaxation for nonconvex quadratic programs
cites work: Complexity analysis of successive convex relaxation methods for nonconvex sets.
cites work: Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
cites work: Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization.
cites work: Cones of Matrices and Set-Functions and 0–1 Optimization
cites work: The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
cites work: A new reformulation-linearization technique for bilinear programming problems
cites work: A reformulation-convexification approach for solving nonconvex quadratic programming problems
cites work: Q4527205
full work available at URL: s0377-2217(02)00298-9
OpenAlex ID: W2109966743
description: scientific article; zbMATH DE number 1832947