Solving conic quadratically constrained quadratic programming problems
The paper is concerned with the conic quadratically constrained quadratic programming problem (CQCQP) and extends results by \textit{C. Lu} et al. [SIAM J. Optim. 21, No. 4, 1475--1490 (2011; Zbl 1242.49044)] for the quadratically constrained quadratic programming problem (QCQP). In particular, KKT conditions for CQCQP and related linear conic reformulations of this problem using the cone of nonnegative quadratic functions are introduced. Moreover, an extended copositiveness condition is proved, which is an extended global optimality condition similar to that by \textit{C. Lu} et al. for QCQP, and an extended global optimality condition is given, which is based on an extended maximal property of the optimal Lagrangian multipliers. This allows the set-up of a computational scheme for the solution of CQCQP under additional assumptions. An example demonstrates the performance of the proposed algorithm.
- 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
- 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)