Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems
From MaRDI portal
Publication:2438409
Recommendations
- First- and second-order optimality conditions for quadratically constrained quadratic programming problems
- Solving conic quadratically constrained quadratic programming problems
- KKT solution and conic relaxation for solving quadratically constrained quadratic programming problems
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- On Some Properties of Quadratic Programs with a Convex Quadratic Constraint
Cites work
- A conic approximation method for the 0-1 quadratic knapsack problem
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- A variational approach to copositive matrices
- Applications of second-order cone programming
- Canonical dual transformation method and generalized triality theory in nonsmooth global optimization
- Computable representation of the cone of nonnegative quadratic forms over a general second-order cone and its application to completely positive programming
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Copositive optimization -- recent developments and applications
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
- Extended canonical duality and conic programming for solving 0-1 quadratic programming problems
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1419369 (Why is no real title available?)
- KKT solution and conic relaxation for solving quadratically constrained quadratic programming problems
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Nonconvex quadratic reformulations and solvable conditions for mixed integer quadratic programming problems
- On Cones of Nonnegative Quadratic Functions
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- Quadratic programming with one negative eigenvalue is NP-hard
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(8)- Properties of equation reformulation of the Karush-Kuhn-Tucker condition for nonlinear second order cone optimization problems
- On solving quadratically constrained quadratic programming problem with one non-convex constraint
- First- and second-order optimality conditions for quadratically constrained quadratic programming problems
- Subgradient-based neural network for nonconvex optimization problems in support vector machines with indefinite kernels
- Copositivity for second-order optimality conditions in general smooth optimization problems
- KKT solution and conic relaxation for solving quadratically constrained quadratic programming problems
- Second-order minimization method for nonsmooth functions allowing convex quadratic approximations of the augment
- On Some Properties of Quadratic Programs with a Convex Quadratic Constraint
This page was built for publication: Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2438409)
