Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
From MaRDI portal
Publication:3648528
DOI10.1137/07070601XzbMath1187.90290MaRDI QIDQ3648528
Publication date: 27 November 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
quadratically constrained quadratic programmingsemidefinite program relaxationstrong Lagrangian duality
Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints, On the complexity of quadratic programming with two quadratic constraints, A necessary and sufficient condition of convexity for SOC reformulation of trust-region subproblem with two intersecting cuts, First- and second-order optimality conditions for quadratically constrained quadratic programming problems, Computing the Signed Distance Between Overlapping Ellipsoids, A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality, Refined bounds on the convergence of block Lanczos method for extended trust-region subproblem, A computational study of global optimization solvers on two trust region subproblems, Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems, A penalty decomposition algorithm with greedy improvement for mean‐reverting portfolios with sparsity and volatility constraints, On the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblem, A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints, On Local Non-Global Minimizers of Quadratic Optimization Problem with a Single Quadratic Constraint, KKT-based primal-dual exactness conditions for the Shor relaxation, (Global) optimization: historical notes and recent developments, Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem, Subspace choices for the Celis-Dennis-Tapia problem, Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem, Application of a multiplier method to uncertain Lur'e-like systems, Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts, Moment inequalities for sums of random matrices and their applications in optimization, On the indefinite quadratic fractional optimization with two quadratic constraints, A Block Lanczos Method for the Extended Trust-Region Subproblem, The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction, Semidefinite relaxation for the total least squares problem with Tikhonov-like regularization, Local nonglobal minima for solving large-scale extended trust-region subproblems, New Results on Narrowing the Duality Gap of the Extended Celis--Dennis--Tapia Problem, New results on Hermitian matrix rank-one decomposition, A Note on Polynomial Solvability of the CDT Problem, Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations, An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem, A Two-Variable Approach to the Two-Trust-Region Subproblem, Maximizing the sum of a generalized Rayleigh quotient and another Rayleigh quotient on the unit sphere via semidefinite programming, Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension, On Chebyshev Center of the Intersection of Two Ellipsoids, Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere, Solving Generalized CDT Problems via Two-Parameter Eigenvalues, A hybrid algorithm for the two-trust-region subproblem, Tilt stability for quadratic programs with one or two quadratic inequality constraints, Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems, An Optimality Gap Test for a Semidefinite Relaxation of a Quadratic Program with Two Quadratic Constraints, Recent advances in trust region algorithms, Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
