An efficient method for non-convex QCQP problems

MaRDI QIDQ4992978zbMATH OpenFDO

Authors Naser Osmanpour, M. Keyanpour

Publication date 14 June 2021

Full work available at URL http://www.yokohamapublishers.jp/online-p/PJO/vol16/pjov17n1p23.pdf

zbMATH Keywords

adaptive ellipsoid based methodglobal optimizationnon-convex quadratically constrained quadratic programmingsemidefinite programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Semidefinite programming (90C22) Convex programming (90C25) Nonconvex programming, global optimization (90C26)

Recommendations

• On solving quadratically constrained quadratic programming problem with one non-convex constraint
• A linearization method for global optimal solution of quadratic programming problem with nonconvex quadratic constraints
• Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems
• A global optimization approach for quadratic programs with nonconvex quadratic constraints
• Global optimization of a class of nonconvex quadratically constrained quadratic programming problems

Cited in

(14)

• Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint
• On solving quadratically constrained quadratic programming problem with one non-convex constraint
• Hidden convexity in some nonconvex quadratically constrained quadratic programming
• Conic approximation to nonconvex quadratic programming with convex quadratic constraints
• QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs
• A reduced proximal-point homotopy method for large-scale non-convex BQP
• scientific article; zbMATH DE number 3848110 (Why is no real title available?)
• An LPCC approach to nonconvex quadratic programs
• Global solution of non-convex quadratically constrained quadratic programs
• A new algorithm for solving nonconvex quadratic programming over an ice cream cone
• A hybrid method for solving non-convex min-max quadratic fractional problems under quadratic constraints
• An iterative rank penalty method for nonconvex quadratically constrained quadratic programs
• Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems
• Global optimization of a class of nonconvex quadratically constrained quadratic programming problems

This page was built for publication: An efficient method for non-convex QCQP problems

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