Journal
JOURNAL OF GLOBAL OPTIMIZATION
Volume 24, Issue 2, Pages 163-185Publisher
KLUWER ACADEMIC PUBL
DOI: 10.1023/A:1020209017701
Keywords
approximation algorithms; stability number; semidefinite programming; copositive cone; standard quadratic optimization; linear matrix inequalities
Ask authors/readers for more resources
The problem of minimizing a (non-convex) quadratic function over the simplex (the standard quadratic optimization problem) has an exact convex reformulation as a copositive programming problem. In this paper we show how to approximate the optimal solution by approximating the cone of copositive matrices via systems of linear inequalities, and, more refined, linear matrix inequalities (LMI's). In particular, we show that our approach leads to a polynomial-time approximation scheme for the standard quadratic optimzation problem. This is an improvement on the previous complexity result by Nesterov who showed that a 2/3-approximation is always possible. Numerical examples from various applications are provided to illustrate our approach.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available