A Branch and Bound Method via d.c. Optimization Algorithms and Ellipsoidal Technique for Box Constrained Nonconvex Quadratic Problems |
| |
Authors: | Le Thi Hoai An Pham Dinh Tao |
| |
Institution: | (1) Mathematical Modelling and Applied Optimization Group, Laboratory of Mathematics, National Institute for Applied Sciences- Rouen, CNRS UPRES-A 60 85, BP 08, F-76131 Mont Saing Aignan, France |
| |
Abstract: | In this paper we propose a new branch and bound algorithm using a rectangular partition and ellipsoidal technique for minimizing a nonconvex quadratic function with box constraints. The bounding procedures are investigated by d.c. (difference of convex functions) optimization algorithms, called DCA. This is based upon the fact that the application of the DCA to the problems of minimizing a quadratic form over an ellipsoid and/or over a box is efficient. Some details of computational aspects of the algorithm are reported. Finally, numerical experiments on a lot of test problems showing the efficiency of our algorithm are presented. |
| |
Keywords: | Branch and bound Ellipsoidal technique d c Optimization DCA Ball constrained quadratic problem Box constrained quadratic problem |
本文献已被 SpringerLink 等数据库收录! |