New optimality conditions for quadratic optimization problems with binary constraints |
| |
| Authors: | Yong Xia |
| |
| Affiliation: | (1) Department of Applied Mathematics, LMIB of the Ministry of Education, Beihang University, 100083 Beijing, People’s Republic of China;(2) CIAS, Central University of Finance and Economics, 100081 Beijing, People’s Republic of China |
| |
| Abstract: | 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. |
| |
| Keywords: | Quadratic programming Optimality conditions Nonconvex optimization Integer programming |
| 本文献已被 SpringerLink 等数据库收录！ |
|
