A Global Optimization Algorithm for Generalized Quadratic Programming
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 relaxat...
Main Authors: | Hongwei Jiao, Yongqiang Chen |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2013-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2013/215312 |
Similar Items
-
Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
by: Hou Zhisong, et al.
Published: (2017-10-01) -
An Effective Global Optimization Algorithm for Quadratic Programs with Quadratic Constraints
by: Dongwei Shi, et al.
Published: (2019-03-01) -
A Novel Optimization Method for Nonconvex Quadratically Constrained Quadratic Programs
by: Hongwei Jiao, et al.
Published: (2014-01-01) -
A parametric linearizing approach for quadratically inequality constrained quadratic programs
by: Jiao Hongwei, et al.
Published: (2018-04-01) -
Global Algorithm for Generalized Affine Multiplicative Programming Problem
by: Jingben Yin, et al.
Published: (2019-01-01)