A new accelerating method for solving quadratic programming

MaRDI QIDQ4927053zbMATH OpenFDO

Authors Chunfeng Wang, Ruifang Huang

Publication date 20 June 2013

zbMATH Keywords

accelerating techniquebranch and boundglobal optimizationlinear relaxationquadratic programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• An accelerating algorithm for globally solving nonconvex quadratic programming
• A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints
• A new algorithm for finding global solution of indefinite quadratic programming problems
• A new global optimization algorithm for indefinite quadratic programs
• A new branch-and-bound algorithm for indefinite quadratic programming problems

Cited in

(8)

• New theoretical results on recursive quadratic programming algorithms
• Extending the quadrangle inequality to speed-up dynamic programming
• A new algorithm for solving the general quadratic programming problem
• Solving quadratic programs to high precision using scaled iterative refinement
• A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints
• Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
• scientific article; zbMATH DE number 5812453 (Why is no real title available?)
• An accelerating algorithm for globally solving nonconvex quadratic programming

This page was built for publication: A new accelerating method for solving quadratic programming

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