![](/images/graphics-bg.png)
A Branch and Bound Reduced Algorithm for Quadratic Programming Problems with Quadratic Constraints
Joint Authors
Li, Feifei
Jin, Siqiao
Gao, Yuelin
Source
Mathematical Problems in Engineering
Issue
Vol. 2013, Issue 2013 (31 Dec. 2013), pp.1-6, 6 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2013-11-11
Country of Publication
Egypt
No. of Pages
6
Main Subjects
Abstract EN
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 degree of approximation and the convergence rate of acceleration, a rectangular reduction strategy is used in the algorithm.
Numerical experiments show that the proposed algorithm is feasible and effective and can solve small- and medium-sized problems.
American Psychological Association (APA)
Gao, Yuelin& Li, Feifei& Jin, Siqiao. 2013. A Branch and Bound Reduced Algorithm for Quadratic Programming Problems with Quadratic Constraints. Mathematical Problems in Engineering،Vol. 2013, no. 2013, pp.1-6.
https://search.emarefa.net/detail/BIM-1032006
Modern Language Association (MLA)
Gao, Yuelin…[et al.]. A Branch and Bound Reduced Algorithm for Quadratic Programming Problems with Quadratic Constraints. Mathematical Problems in Engineering No. 2013 (2013), pp.1-6.
https://search.emarefa.net/detail/BIM-1032006
American Medical Association (AMA)
Gao, Yuelin& Li, Feifei& Jin, Siqiao. A Branch and Bound Reduced Algorithm for Quadratic Programming Problems with Quadratic Constraints. Mathematical Problems in Engineering. 2013. Vol. 2013, no. 2013, pp.1-6.
https://search.emarefa.net/detail/BIM-1032006
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1032006