A Branch and Bound Reduced Algorithm for Quadratic Programming Problems with Quadratic Constraints
We propose a branch and bound reduced algorithm for quadratic programming problems with quadratic constraints. In this algorithm, we determine the lower bound of the optimal value of original problem by constructing a linear relaxation programming problem. At the same time, in order to improve the d...
Main Authors: | Yuelin Gao, Feifei Li, Siqiao Jin |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2013-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2013/594693 |
Similar Items
-
A New Spatial Branch and Bound Algorithm for Quadratic Program with One Quadratic Constraint and Linear Constraints
by: Jing Zhou
Published: (2020-01-01) -
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) -
Branch-and-Reduction Algorithm for Indefinite Quadratic Programming Problem
by: Yongjian Qiu, et al.
Published: (2021-01-01) -
A Branch-and-Bound Algorithm for Quadratically-Constrained Sparse Filter Design
by: Wei, Dennis, et al.
Published: (2014)