On the finite convergence of successive semidefinite programming relaxation methods

On the finite convergence of successive semidefinite programming relaxation methods

0.00 Avg rating—0 Votes
Article ID: iaor20032082
Country: Netherlands
Volume: 143
Issue: 2
Start Page Number: 325
End Page Number: 341
Publication Date: Dec 2002
Journal: European Journal of Operational Research
Authors: ,
Keywords: semidefinite programming
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.

Reviews

Required fields are marked *. Your email address will not be published.