KKT-based primal-dual exactness conditions for the Shor relaxation
From MaRDI portal
Publication:6104908
Abstract: In this work we present some exactness conditions for the Shor relaxation of diagonal QCQPs, which extend the conditions introduced in different recent papers about the same topic. It is shown that the Shor relaxation is equivalent to two convex quadratic relaxations. Then, sufficient conditions for the exactness of the relaxations are derived from their KKT systems. It will be shown that, in some cases, by this derivation previous conditions in the literature, which can be viewed as dual conditions, since they only involve the Lagrange multipliers appearing in the KKT systems, can be extended to primal-dual conditions, which also involve the primal variables appearing in the KKT systems.
Recommendations
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- Exactness criteria for SDP-relaxations of quadratic extremum problems
- Exactness conditions for an SDP relaxation of the extended trust region problem
- On the tightness of SDP relaxations of QCQPs
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
Cites work
- A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
- A note on polynomial solvability of the CDT problem
- A two-variable approach to the two-trust-region subproblem
- Correction to: ``Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- Exact second-order cone programming relaxations for some nonconvex minimax quadratic optimization problems
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- Exactness conditions for an SDP relaxation of the extended trust region problem
- Exactness of semidefinite relaxations for nonlinear optimization problems with underlying graph structure
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems
- scientific article; zbMATH DE number 4070633 (Why is no real title available?)
- scientific article; zbMATH DE number 3658558 (Why is no real title available?)
- New results on narrowing the duality gap of the extended Celis-Dennis-Tapia problem
- New Results on Quadratic Minimization
- On Cones of Nonnegative Quadratic Functions
- On the complexity of quadratic programming with two quadratic constraints
- On the tightness of SDP relaxations of QCQPs
- Polynomial Solvability of Variants of the Trust-Region Subproblem
- Second-order-cone constraints for extended trust-region subproblems
- Solving generalized CDT problems via two-parameter eigenvalues
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- The trust region subproblem with non-intersecting linear constraints
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
Cited in
(3)
This page was built for publication: KKT-based primal-dual exactness conditions for the Shor relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6104908)
