论文信息 - Convex Hull Presentation of a quadratically Constrained Set and its Application in Solving Quadratic Programming Problems - 字舞流文

Convex Hull Presentation of a quadratically Constrained Set and its Application in Solving Quadratic Programming Problems

In this article, we study the convex hull presentation of a quadratically constrained set. Applying the new result, we solve a kind of quadratically constrained quadratic programming problems, which generalizes many well-studied problems.

[1] S. Karisch. Trust Regions and the Quadratic Assignment Problem , 1992 .

[2] J. P. Williams,et al. Some convexity theorems for matrices , 1971, Glasgow Mathematical Journal.

[3] Franz Rendl,et al. Trust Regions and Relaxations for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[4] Nair Maria Maia de Abreu,et al. A survey for the quadratic assignment problem , 2007, Eur. J. Oper. Res..

[5] G. Finke. Quadratic Assignment Problems , 1987 .

[6] Panos M. Pardalos,et al. Quadratic Assignment and Related Problems , 1994 .

[7] Jinyan Fan,et al. Quadratic programs over the Stiefel manifold , 2006, Oper. Res. Lett..

[8] Alfonsas Misevicius. Ruin and Recreate Principle Based Approach for the Quadratic Assignment Problem , 2003, GECCO.

[9] Michael L. Overton,et al. On the Sum of the Largest Eigenvalues of a Symmetric Matrix , 1992, SIAM J. Matrix Anal. Appl..