Global optimization for non-convex quadratic programs with additional multiplicative constraints

MaRDI QIDQ2923581zbMATH OpenFDO

Authors Junhua Wang, Lianjie Tang, Peiping Shen

Publication date 3 November 2014

Published in Numerical Mathematics (Search for Journal in Brave)

zbMATH Keywords

global optimizationbranch and boundmultiplicative programmingduality bound

Mathematics Subject Classification ID

Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Recommendations

• A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints
• Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems
• An effective global optimization algorithm for quadratic programs with quadratic constraints
• A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs
• Globally solving nonconvex quadratic programming problems via completely positive programming

Cited in

(5)

• An effective global optimization algorithm for quadratic programs with quadratic constraints
• Duality Bound Methods in Global Optimization
• A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints
• A novel optimization method for nonconvex quadratically constrained quadratic programs
• A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints

This page was built for publication: Global optimization for non-convex quadratic programs with additional multiplicative constraints

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