A new branch-and-bound algorithm for indefinite quadratic programming problems

MaRDI QIDQ3573866zbMATH OpenFDO

Authors Peng Wang, Lin Ma, Jie Li, Jian-Ling Li

Publication date 8 July 2010

zbMATH Keywords

branch-and-boundconvex relaxationD.C. decompositionindefinite quadratic programmingLagrangian dual bound

Mathematics Subject Classification ID

Quadratic programming (90C20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A new algorithm for finding global solution of indefinite quadratic programming problems
• A new branch and bound algorithm for indefinite integer quadratic programs
• A new algorithm based on Lagrangian relaxation for solving indefinite quadratic integer programming
• Global minimization of indefinite quadratic problems
• A computational comparison of some branch and bound methods for indefinite quadratic programs

Cited in

(16)

• Global minimization of indefinite quadratic problems
• An algorithm for indefinite quadratic programming with convex constraints
• Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
• An algorithm for indefinite integer quadratic programming
• A new algorithm based on Lagrangian relaxation for solving indefinite quadratic integer programming
• A new branch and bound algorithm for indefinite integer quadratic programs
• An efficient global algorithm for a class of indefinite separable quadratic programs
• A method of global optimization for indefinite quadratic programming problems
• A new global optimization algorithm for indefinite quadratic programs
• scientific article; zbMATH DE number 4172744 (Why is no real title available?)
• An algorithm for indefinite quadratic programming based on a partial Cholesky factorization
• A new accelerating method for solving quadratic programming
• scientific article; zbMATH DE number 7366738 (Why is no real title available?)
• A new algorithm for finding global solution of indefinite quadratic programming problems
• A new algorithm for the general quadratic programming problems with box constraints
• A computational comparison of some branch and bound methods for indefinite quadratic programs

This page was built for publication: A new branch-and-bound algorithm for indefinite quadratic programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3573866)