Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem
From MaRDI portal
Publication:6161303
DOI10.1137/21m144548xzbMath1519.90146arXiv2102.11161OpenAlexW3130881115MaRDI QIDQ6161303
Luca Consolini, Marco Locatelli
Publication date: 27 June 2023
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.11161
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
- A computational study of global optimization solvers on two trust region subproblems
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- On the complexity of quadratic programming with two quadratic constraints
- Feasibility testing for systems of real quadratic equations
- A Note on Polynomial Solvability of the CDT Problem
- A Two-Variable Approach to the Two-Trust-Region Subproblem
- Solving Generalized CDT Problems via Two-Parameter Eigenvalues
- Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem
- Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem
- Computing a Trust Region Step
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- Newton’s Method with a Model Trust Region Modification
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- New Results on Quadratic Minimization
- Closing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region Subproblem
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
- On Cones of Nonnegative Quadratic Functions
- New Results on Narrowing the Duality Gap of the Extended Celis--Dennis--Tapia Problem
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- Set-valued analysis
This page was built for publication: Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem
