![](/images/graphics-bg.png)
A Global Optimization Algorithm for Generalized Quadratic Programming
Joint Authors
Source
Journal of Applied Mathematics
Issue
Vol. 2013, Issue 2013 (31 Dec. 2013), pp.1-9, 9 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2013-10-22
Country of Publication
Egypt
No. of Pages
9
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Jiao, Hongwei& Chen, Yongqiang. 2013. A Global Optimization Algorithm for Generalized Quadratic Programming. Journal of Applied Mathematics،Vol. 2013, no. 2013, pp.1-9.
https://search.emarefa.net/detail/BIM-455204
Modern Language Association (MLA)
Jiao, Hongwei& Chen, Yongqiang. A Global Optimization Algorithm for Generalized Quadratic Programming. Journal of Applied Mathematics No. 2013 (2013), pp.1-9.
https://search.emarefa.net/detail/BIM-455204
American Medical Association (AMA)
Jiao, Hongwei& Chen, Yongqiang. A Global Optimization Algorithm for Generalized Quadratic Programming. Journal of Applied Mathematics. 2013. Vol. 2013, no. 2013, pp.1-9.
https://search.emarefa.net/detail/BIM-455204
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-455204