Global Optimization of Concave Functions Subject to Separable Quadratic Constraints and of All-Quadratic Separable Problems

Author(s):  
Fais A. AL-Khayyal ◽  
Reiner Horst ◽  
Panos M. Pardalos
2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Hongwei Jiao ◽  
Yongqiang Chen

We present a global optimization algorithm for solving generalized quadratic programming (GQP), that is, nonconvex quadratic programming with nonconvex quadratic constraints. By utilizing a new linearizing technique, the initial nonconvex programming problem (GQP) is reduced to a sequence of relaxation linear programming problems. To improve the computational efficiency of the algorithm, a range reduction technique is employed in the branch and bound procedure. The proposed algorithm is convergent to the global minimum of the (GQP) by means of the subsequent solutions of a series of relaxation linear programming problems. Finally, numerical results show the robustness and effectiveness of the proposed algorithm.


Author(s):  
Reiner Horst ◽  
Hoang Tuy
Keyword(s):  

Informatica ◽  
2016 ◽  
Vol 27 (2) ◽  
pp. 323-334 ◽  
Author(s):  
James M. Calvin

Sign in / Sign up

Export Citation Format

Share Document