A New Spatial Branch and Bound Algorithm for Quadratic Program with One Quadratic Constraint and Linear Constraints
This paper proposes a novel second-order cone programming (SOCP) relaxation for a quadratic program with one quadratic constraint and several linear constraints (QCQP) that arises in various real-life fields. This new SOCP relaxation fully exploits the simultaneous matrix diagonalization technique w...
Main Author: | Jing Zhou |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2020-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2020/5717301 |
Similar Items
-
A Branch and Bound Reduced Algorithm for Quadratic Programming Problems with Quadratic Constraints
by: Yuelin Gao, et al.
Published: (2013-01-01) -
An Effective Global Optimization Algorithm for Quadratic Programs with Quadratic Constraints
by: Dongwei Shi, et al.
Published: (2019-03-01) -
A Complete Solution to Quadratic Programming with One Inequality Quadratic Constraint
by: Gang-XuanLin, et al.
Published: (2018) -
Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
by: Hou Zhisong, et al.
Published: (2017-10-01) -
Solutions to Nonconvex Quadratic Programming over One Non-Homogeneous Quadratic Constraint
by: Joe-MeiFeng, et al.
Published: (2010)