Li, Jianling; Wang, Peng; Ma, Lin; Li, Jie A new branch-and-bound algorithm for indefinite quadratic programming problems. (Chinese. English summary) Zbl 1212.90415 J. Guangxi Univ., Nat. Sci. 34, No. 4, 561-564 (2009). Summary: A new algorithm for finding a global solution of indefinite quadratic programming problems is proposed. The problem is reformulated first as a separable form by D.C. decomposition and Cholesky factorization. Then, the Lagrangian dual bound is derived. A new branch-and-bound algorithm based on the Lagrangian dual bounds and rectangular bisection is presented. Finally, preliminary numerical results are reported. MSC: 90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut 90C20 Quadratic programming Keywords:indefinite quadratic programming; branch-and-bound; D.C. decomposition; convex relaxation; Lagrangian dual bound PDFBibTeX XMLCite \textit{J. Li} et al., J. Guangxi Univ., Nat. Sci. 34, No. 4, 561--564 (2009; Zbl 1212.90415)