Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
From MaRDI portal
Publication:5757352
DOI10.1137/050644471zbMath1128.90044MaRDI QIDQ5757352
Publication date: 6 September 2007
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050644471
90C26: Nonconvex programming, global optimization
90C20: Quadratic programming
90C46: Optimality conditions and duality in mathematical programming
Related Items
Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems, A Block Lanczos Method for the Extended Trust-Region Subproblem, 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, Unnamed Item, Some remarks on duality and optimality of a class of constrained convex quadratic minimization problems, Unnamed Item, 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, 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, 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, S-lemma with equality and its applications, Trust region subproblem with an additional linear inequality constraint, 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, Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization, 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, 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, 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 fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality, 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, Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint, Centered solutions for uncertain linear equations, Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty, 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, A survey of hidden convex optimization, Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming, 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, Geometric properties for level sets of quadratic functions, 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
Uses Software
