SOLVING NONCONVEX QUADRATIC PROGRAMMING PROBLEMS USING A BRANCH AND BOUND METHOD WITH INNER AND OUTER BOX APPROXIMATIONS
We investigate a nonconvex quadratic programming problem with the bounded feasible set. This problem has solutions only on the boundary of the feasible set. Using the separable form of the problem, we propose a branch and bound procedure, where only the difference between outer and inner box approximations of the feasible region is considered and partitioned further. The method is also adapted for finding all global solutions of the problem.
Библиографическая ссылка
MINARCHENKO I., Khamisov O.O. SOLVING NONCONVEX QUADRATIC PROGRAMMING PROBLEMS USING A BRANCH AND BOUND METHOD WITH INNER AND OUTER BOX APPROXIMATIONS // PROCEEDINGS OF THE 9TH INTERNATIONAL SCHOOL-SEMINAR ON NONLINEAR ANALYSIS AND EXTREMAL PROBLEMS (NLA-2026). ID:92163930. 2026. P.149-150.
