An effective algorithm for globally solving quadratic programs using parametric linearization technique
In this paper, we present an effective algorithm for globally solving quadratic programs with quadratic constraints, which has wide application in engineering design, engineering optimization, route optimization, etc. By utilizing new parametric linearization technique, we can derive the parametric...
Main Authors: | Tang Shuai, Chen Yuzhen, Guo Yunrui |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2018-11-01
|
Series: | Open Mathematics |
Subjects: | |
Online Access: | https://doi.org/10.1515/math-2018-0108 |
Similar Items
-
A parametric linearizing approach for quadratically inequality constrained quadratic programs
by: Jiao Hongwei, et al.
Published: (2018-04-01) -
Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
by: Hou Zhisong, et al.
Published: (2017-10-01) -
Globally convergent three-term conjugate gradient projection methods for solving nonlinear monotone equations
by: Mompati S. Koorapetse, et al.
Published: (2018-05-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) -
An inertial forward–backward algorithm for the minimization of the sum of two nonconvex functions
by: Radu Ioan Boţ, et al.
Published: (2016-02-01)