On convergence of the block Lanczos method for the CDT subproblem

DOI10.1007/S12190-024-02265-3MaRDI QIDQ6987512zbMATH OpenFDO

Authors Ying Gu, Yongyan Guo

Publication date 6 May 2025

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S12190-024-02265-3

zbMATH Keywords

block-Lanczos methodCDT subproblemconvergence analysisKrylov subspace

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Cites work

• A block Lanczos method for the CDT subproblem
• A Global Convergence Theory for the Celis–Dennis–Tapia Trust-Region Algorithm for Constrained Optimization
• A note on polynomial solvability of the CDT problem
• A subspace version of the Powell-Yuan trust-region algorithm for equality constrained optimization
• A two-variable approach to the two-trust-region subproblem
• Computing a Celis-Dennis-Tapia trust-region step for equality constrained optimization
• scientific article; zbMATH DE number 3903874 (Why is no real title available?)
• scientific article; zbMATH DE number 37938 (Why is no real title available?)
• scientific article; zbMATH DE number 1049350 (Why is no real title available?)
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• scientific article; zbMATH DE number 2218045 (Why is no real title available?)
• Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
• Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
• Numerical methods for large eigenvalue problems
• On a subproblem of trust region algorithms for constrained optimization
• On Cones of Nonnegative Quadratic Functions
• On KKT points of Celis-Dennis-Tapia subproblem
• On Local Solutions of the Celis--Dennis--Tapia Subproblem
• On maxima of dual function of the CDT subproblem
• Parallel iterative methods for sparse linear systems
• Second-order-cone constraints for extended trust-region subproblems
• Solving generalized CDT problems via two-parameter eigenvalues
• Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
• Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
• Trust Region Methods

This page was built for publication: On convergence of the block Lanczos method for the CDT subproblem

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