Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
From MaRDI portal
Publication:5757352
Recommendations
- Quadratic problems with two quadratic constraints: convex quadratic relaxation and strong lagrangian duality
- Several results on the strong duality of QCQP
- A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere
Cited in
(75)- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
- Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming
- A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications
- Quadratic programs with hollows
- A computational study of global optimization solvers on two trust region subproblems
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
- A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
- Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint
- Centered solutions for uncertain linear equations
- Dorn's duality for quadratic programs revisited: The nonconvex case
- Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty
- Strong duality for a trust-region type relaxation of the quadratic assignment problem
- Parametric approach for solving quadratic fractional optimization with a linear and a quadratic constraint
- Chebyshev center of the intersection of balls: complexity, relaxation and approximation
- Exact dual bounds for some nonconvex minimax quadratic optimization problems
- Strong duality for general quadratic programs with quadratic equality constraints
- On the tightness of SDP relaxations of QCQPs
- On the local stability of semidefinite relaxations
- A survey of hidden convex optimization
- A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
- Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere
- A hybrid algorithm for the two-trust-region subproblem
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- Generalized S-lemma and strong duality in nonconvex quadratic programming
- Proximal gradient methods for multiobjective optimization and their applications
- S-lemma with equality and its applications
- Geometric properties for level sets of quadratic functions
- Trust region subproblem with an additional linear inequality constraint
- A note on polynomial solvability of the CDT problem
- A two-variable approach to the two-trust-region subproblem
- Kronecker product constraints with an application to the two-trust-region subproblem
- SDP reformulation for robust optimization problems based on nonconvex QP duality
- On zero duality gap in nonconvex quadratic programming problems
- Semidefinite complementarity reformulation for robust Nash equilibrium problems with Euclidean uncertainty sets
- A new semidefinite programming relaxation scheme for a class of quadratic matrix problems
- The generalized trust region subproblem
- Exact second-order cone programming relaxations for some nonconvex minimax quadratic optimization problems
- A block Lanczos method for the extended trust-region subproblem
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- Minimizing an indefinite quadratic function subject to a single indefinite quadratic constraint
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems
- Some remarks on duality and optimality of a class of constrained convex quadratic minimization problems
- Matrix completion and related problems via strong duality
- Quadratic problems with two quadratic constraints: convex quadratic relaxation and strong lagrangian duality
- Characterizing Convexity of Images for Quadratic-Linear Mappings with Applications in Nonconvex Quadratic Optimization
- On Convex Hulls of Epigraphs of QCQPs
- Simultaneous diagonalization via congruence of Hermitian matrices: some equivalent conditions and a numerical solution
- Non-convex matrix completion and related problems via strong duality
- On Chebyshev center of the intersection of two ellipsoids
- Solving a type of the Tikhonov regularization of the total least squares by a new s-lemma
- Several results on the strong duality of QCQP
- A proximal operator for multispectral phase retrieval problems
- Canonical dual solutions to quadratic optimization over one quadratic constraint
- A second-order cone based approach for solving the trust-region subproblem and its variants
- Quadratic Matrix Programming
- Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems
- New results on narrowing the duality gap of the extended Celis-Dennis-Tapia problem
- An optimality gap test for a semidefinite relaxation of a quadratic program with two quadratic constraints
- A new technique to derive tight convex underestimators (sometimes envelopes)
- Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Moment inequalities for sums of random matrices and their applications in optimization
- An efficient splitting algorithm for solving the CDT subproblem
- Solving two-trust-region subproblems using semidefinite optimization with eigenvector branching
- Non-convex optimization problems with linear KKT subsystem
- On convergence of the block Lanczos method for the CDT subproblem
- On the tightness of an SDP relaxation for homogeneous QCQP with three real or four complex homogeneous constraints
- Worst-case learning under a multifidelity model
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
- Quadratic optimization with two ball constraints
- Robust linear MIMO in the downlink: A worst-case optimization with ellipsoidal uncertainty regions
- On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls
This page was built for publication: Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757352)
