A Novel Optimization Method for Nonconvex Quadratically Constrained Quadratic Programs

Hongwei Jiao, Yong-Qiang Chen and Wei-Xin Cheng

Abstract and Applied Analysis, 2014, vol. 2014, 1-11

Abstract:

This paper presents a novel optimization method for effectively solving nonconvex quadratically constrained quadratic programs (NQCQP) problem. By applying a novel parametric linearizing approach, the initial NQCQP problem and its subproblems can be transformed into a sequence of parametric linear programs relaxation problems. To enhance the computational efficiency of the presented algorithm, a cutting down approach is combined in the branch and bound algorithm. By computing a series of parametric linear programs problems, the presented algorithm converges to the global optimum point of the NQCQP problem. At last, numerical experiments demonstrate the performance and computational superiority of the presented algorithm.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/AAA/2014/698489.pdf (application/pdf)
http://downloads.hindawi.com/journals/AAA/2014/698489.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:jnlaaa:698489

DOI: 10.1155/2014/698489

Access Statistics for this article

More articles in Abstract and Applied Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().