论文信息 - Global quadratic optimization on the sets with simplex structure

Global quadratic optimization on the sets with simplex structure

In the first part of this paper we prove that the global quadratic optimization problem over a simplex can be solved with a constant relative accuracy. In the second part we consider some natural extensions of the result.

Yurii Nesterov

[1] Y. Nesterov. Global quadratic optimization via conic relaxation , 1998 .

[2] Y. Ye. Approximating Quadratic Programming With Bound Constraints , 1997 .

[3] Y. Nesterov. Quality of semidefinite relaxation for nonconvex quadratic optimization , 1997 .

[4] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.