A Global Optimization Algorithm for Generalized Quadratic Programming

Hongwei Jiao and Yongqiang Chen

Journal of Applied Mathematics, 2013, vol. 2013, 1-9

Abstract:

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.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/JAM/2013/215312.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2013/215312.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnljam:215312

DOI: 10.1155/2013/215312

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().