A parametric linearizing approach for quadratically inequality constrained quadratic programs
In this paper we propose a new parametric linearizing approach for globally solving quadratically inequality constrained quadratic programs. By utilizing this approach, we can derive the parametric linear programs relaxation problem of the investigated problem. To accelerate the computational speed...
Main Authors: | Jiao Hongwei, Chen Rongjiang |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2018-04-01
|
Series: | Open Mathematics |
Subjects: | |
Online Access: | https://doi.org/10.1515/math-2018-0037 |
Similar Items
-
Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
by: Hou Zhisong, et al.
Published: (2017-10-01) -
An effective algorithm for globally solving quadratic programs using parametric linearization technique
by: Tang Shuai, et al.
Published: (2018-11-01) -
Conic optimization: A survey with special focus on copositive optimization and binary quadratic problems
by: Mirjam Dür, et al.
Published: (2021-01-01) -
A linear formulation with O(n2) variables for quadratic assignment problems with Manhattan distance matrices
by: Serigne Gueye, et al.
Published: (2015-05-01) -
Quadratically Constrained Quadratic Programming Formulation of Contingency Constrained Optimal Power Flow with Photovoltaic Generation
by: Luis M. Leon, et al.
Published: (2020-06-01)