Solving conic quadratically constrained quadratic programming problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 57066
- scientific article; zbMATH DE number 618550
- Convex quadratic programming approach
- scientific article; zbMATH DE number 3871035
- Solving quadratically constrained convex optimization problems with an interior-point method
- Convex quadratic mixed-integer problems with quadratic constraints
- On quadratic and complete quadratic problems of convex programming
- Conic approximation to quadratic optimization with linear complementarity constraints
- scientific article; zbMATH DE number 7647868
- Quadratic optimization over a polyhedral cone
Cited in
(8)- Quadratic cone cutting surfaces for quadratic programs with on-off constraints
- Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems
- Quadratic Eigenvalue Problems under Conic Constraints
- On conic QPCCs, conic QCQPs and completely positive programs
- KKT solution and conic relaxation for solving quadratically constrained quadratic programming problems
- Solving Quadratic Programming by Cutting Planes
- A new algorithm for solving nonconvex quadratic programming over an ice cream cone
- On global solvability of a class of possibly nonconvex QCQP problems in Hilbert spaces
This page was built for publication: Solving conic quadratically constrained quadratic programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2928413)