On Local Solutions of the Celis--Dennis--Tapia Subproblem

DOI10.1137/S1052623498335018zbMATH Open0957.65060OpenAlexW2025251058MaRDI QIDQ4518166FDOQ4518166

Xiongda Chen, Yaxiang Yuan

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

Recommendations

• Subspace choices for the Celis-Dennis-Tapia problem
• Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
• Local minima of the trust region problem
• On KKT points of Celis-Dennis-Tapia subproblem
• Computing a Celis-Dennis-Tapia trust-region step for equality constrained optimization

zbMATH Keywords

quadratic programmingoptimality conditionslocal solutionstrust region subproblemtrust region algorithmsnonlocal programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Methods of successive quadratic programming type (90C55)

Cited In (17)

• Global Optimality Conditions for Classes of Non-convex Multi-objective Quadratic Optimization Problems
• Solving generalized CDT problems via two-parameter eigenvalues
• Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
• Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
• The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction
• On KKT points of Celis-Dennis-Tapia subproblem
• The convergence of subspace trust region methods
• On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints
• New Results on Narrowing the Duality Gap of the Extended Celis--Dennis--Tapia Problem
• Title not available (Why is that?)
• On Chebyshev Center of the Intersection of Two Ellipsoids
• A computational study of global optimization solvers on two trust region subproblems
• On the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblem
• A note on polynomial solvability of the CDT problem
• Recent advances in trust region algorithms
• Subspace choices for the Celis-Dennis-Tapia problem
• On local nonglobal minimum of trust-region subproblem and extension

This page was built for publication: On Local Solutions of the Celis--Dennis--Tapia Subproblem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4518166)