A Note on Polynomial Solvability of the CDT Problem
From MaRDI portal
Publication:2789609
DOI10.1137/15M1009871zbMath1382.90083arXiv1406.6429OpenAlexW1941836914MaRDI QIDQ2789609
Publication date: 2 March 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.6429
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Numerical methods based on nonlinear programming (49M37) Methods of successive quadratic programming type (90C55)
Related Items (34)
On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints ⋮ Computing the Signed Distance Between Overlapping Ellipsoids ⋮ When a system of real quadratic equations has a solution ⋮ On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations ⋮ Comment on: ``Approximation algorithms for quadratic programming ⋮ A computational study of global optimization solvers on two trust region subproblems ⋮ A survey of hidden convex optimization ⋮ A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants ⋮ 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 ⋮ KKT-based primal-dual exactness conditions for the Shor relaxation ⋮ Optimization under uncertainty and risk: quadratic and copositive approaches ⋮ (Global) optimization: historical notes and recent developments ⋮ Finding second-order stationary points in constrained minimization: a feasible direction approach ⋮ Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem ⋮ Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow ⋮ How Do Exponential Size Solutions Arise in Semidefinite Programming? ⋮ Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem ⋮ The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction ⋮ Efficient local search procedures for quadratic fractional programming problems ⋮ A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs ⋮ New Results on Narrowing the Duality Gap of the Extended Celis--Dennis--Tapia 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 ⋮ Complexity, exactness, and rationality in polynomial optimization ⋮ On Chebyshev Center of the Intersection of Two Ellipsoids ⋮ Complexity, exactness, and rationality in polynomial optimization ⋮ Solving Generalized CDT Problems via Two-Parameter Eigenvalues ⋮ A Linear-Time Algorithm for Globally Maximizing the Sum of a Generalized Rayleigh Quotient and a Quadratic Form on the Unit Sphere ⋮ A hybrid algorithm for the two-trust-region subproblem ⋮ Tilt stability for quadratic programs with one or two quadratic inequality constraints ⋮ A gentle, geometric introduction to copositive optimization ⋮ Recent advances in trust region algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- On a subproblem of trust region algorithms for constrained optimization
- Bounding the Betti numbers and computing the Euler-Poincaré characteristic of semi-algebraic sets defined by partly quadratic systems of polynomials
- Polynomial-time computing over quadratic maps i: sampling in real algebraic sets
- Estimating \(L^\infty\) norms by \(L^{2k}\) norms for functions on orbits.
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- Feasibility testing for systems of real quadratic equations
- The trust region subproblem with non-intersecting linear constraints
- A Two-Variable Approach to the Two-Trust-Region Subproblem
- A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets
- Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
- Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- New Results on Quadratic Minimization
- Trust Region Methods
- On Local Solutions of the Celis--Dennis--Tapia Subproblem
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- A Survey of the S-Lemma
- Algorithms in real algebraic geometry
This page was built for publication: A Note on Polynomial Solvability of the CDT Problem
