A new global optimization algorithm for indefinite quadratic programs

MaRDI QIDQ3114016zbMATH OpenFDO

Authors Chunfeng Wang, Jianke Zhang, Sanyang Liu

Publication date 27 January 2012

zbMATH Keywords

branch and boundglobal optimizationindefinite quadratic programminglinearization relaxation

Mathematics Subject Classification ID

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

Recommendations

• A method of global optimization for indefinite quadratic programming problems
• A global optimization algorithm for indefinite quadratically constrained quadratic programs
• A new algorithm for finding global solution of indefinite quadratic programming problems
• A new branch-and-bound algorithm for indefinite quadratic programming problems
• Global optimization algorithms for linearly constrained indefinite quadratic problems

Cited in

(7)

• A new algorithm based on Lagrangian relaxation for solving indefinite quadratic integer programming
• A method of global optimization for indefinite quadratic programming problems
• scientific article; zbMATH DE number 7234393 (Why is no real title available?)
• scientific article; zbMATH DE number 484155 (Why is no real title available?)
• A new accelerating method for solving quadratic programming
• A global optimization algorithm for indefinite quadratically constrained quadratic programs
• Global optimization algorithms for linearly constrained indefinite quadratic problems

This page was built for publication: A new global optimization algorithm for indefinite quadratic programs

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