First- and second-order optimality conditions for quadratically constrained quadratic programming problems
A quadratic programming problem is considered with general quadratic cone constraints and an additional geometric constraint. The necessary and sufficient conditions are established for global optimality for a KKT point or in the presence of the property of strong duality, considering in details the case where the feasible set is defined by two quadratic equality constraints. As a further application, those conditions seem to guarantee the existence of a convex reformulation of a simultaneous diagonalizable quadratic problem.
- Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems
- Simultaneous diagonalization of matrices and its applications in quadratically constrained quadratic programming
- First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition
- Optimality conditions for quadratic programming problems in Hilbert spaces
- New constraint qualifications and optimality conditions for second order cone programs
- Characterizing FJ and KKT conditions in nonconvex mathematical programming with applications
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- Contingent cone to a set defined by equality and inequality constraints at a Fréchet differentiable point
- Copositivity for second-order optimality conditions in general smooth optimization problems
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
- Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition
- Handbook of global optimization
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 734930 (Why is no real title available?)
- Nonlinear Programming
- On zero duality gap in nonconvex quadratic programming problems
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
- Some applications of the image space analysis to the duality theory for constrained extremum problems
- Some results for quadratic problems with one or two quadratic constraints
- Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- Strong duality in cone constrained nonconvex optimization
- Theorems of the alternative and optimality conditions
- Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems
- Simultaneous diagonalization of matrices and its applications in quadratically constrained quadratic programming
- Nonconvex homogeneous optimization: a general framework and optimality conditions of first and second-order
- Simultaneous diagonalization under weak regularity and a characterization
- Directional differentiability of the optimal value function in quadratic programming problem on Hilbert spaces
- Robust solutions for a class of quadratic optimization problems without classical convexity assumptions
This page was built for publication: First- and second-order optimality conditions for quadratically constrained quadratic programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139247)
