KKT solution and conic relaxation for solving quadratically constrained quadratic programming problems
From MaRDI portal
Publication:3225239
Recommendations
- Solving conic quadratically constrained quadratic programming problems
- Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems
- An effective global optimization algorithm for quadratic programs with quadratic constraints
- Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
- Globally solving nonconvex quadratic programming problems via completely positive programming
Cited in
(21)- Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems
- An approximation algorithm for optimal piecewise linear interpolations of bounded variable products
- Adaptive computable approximation to cones of nonnegative quadratic functions
- Quadratic optimization over a polyhedral cone
- The unconstrained binary quadratic programming problem: a survey
- Semidefinite representable reformulations for two variants of the trust-region subproblem
- Architecting a fully fuzzy information model for multi-level quadratically constrained quadratic programming problem
- Global solutions to a class of CEC benchmark constrained optimization problems
- Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems
- Maximum probability O-D matrix estimation in large-sized networks
- Completely positive and copositive program modelling for quadratic optimization problems
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems
- Doubly nonnegative relaxation method for solving multiple objective quadratic programming problems
- On conic QPCCs, conic QCQPs and completely positive programs
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
- Convex hull results on quadratic programs with non-intersecting constraints
- On solving quadratically constrained quadratic programming problem with one non-convex constraint
- Conic approximation to nonconvex quadratic programming with convex quadratic constraints
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature
This page was built for publication: KKT solution and conic relaxation for solving quadratically constrained quadratic programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3225239)
