On Local Solutions of the Celis--Dennis--Tapia Subproblem
From MaRDI portal
Publication:4518166
DOI10.1137/S1052623498335018zbMath0957.65060OpenAlexW2025251058MaRDI QIDQ4518166
Publication date: 20 November 2000
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623498335018
quadratic programmingoptimality conditionslocal solutionstrust region subproblemtrust region algorithmsnonlocal programming
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Methods of successive quadratic programming type (90C55)
Related Items
On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints ⋮ The convergence of subspace trust region methods ⋮ On KKT points of Celis-Dennis-Tapia 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 ⋮ On the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblem ⋮ Subspace choices for the Celis-Dennis-Tapia problem ⋮ Global Optimality Conditions for Classes of Non-convex Multi-objective Quadratic Optimization Problems ⋮ The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction ⋮ New Results on Narrowing the Duality Gap of the Extended Celis--Dennis--Tapia Problem ⋮ A Note on Polynomial Solvability of the CDT Problem ⋮ On Chebyshev Center of the Intersection of Two Ellipsoids ⋮ Solving Generalized CDT Problems via Two-Parameter Eigenvalues ⋮ On local nonglobal minimum of trust-region subproblem and extension ⋮ Recent advances in trust region algorithms ⋮ Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
