论文信息 - New optimality conditions for quadratic optimization problems with binary constraints

New optimality conditions for quadratic optimization problems with binary constraints

In this article, we obtain new sufficient optimality conditions for the nonconvex quadratic optimization problems with binary constraints by exploring local optimality conditions. The relation between the optimal solution of the problem and that of its continuous relaxation is further extended.

Yong Xia | Yong Xia

[1] Panos M. Pardalos,et al. Topics in Semidefinite and Interior-Point Methods , 1998 .

[2] T Talaky,et al. Interior Point Methods of Mathematical Programming , 1997 .

[3] Tibor Csendes,et al. Developments in Global Optimization , 1997 .

[4] Jorge J. Moré,et al. Computing a Trust Region Step , 1983 .

[5] Panos M. Pardalos,et al. Quadratic Programming with Box Constraints , 1997 .

[6] Stephen P. Boyd,et al. Semidefinite Programming , 1996, SIAM Rev..

[7] Pierre Hansen,et al. Global minimization of indefinite quadratic functions subject to box constraints , 1991 .

[8] Marc Teboulle,et al. Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints , 2000, SIAM J. Optim..

[9] Nicholas I. M. Gould,et al. Solving the Trust-Region Subproblem using the Lanczos Method , 1999, SIAM J. Optim..