Implicitly restarted projection algorithm for solving optimization problems
From MaRDI portal
Publication:4508639
DOI10.1080/01630560008816959zbMath0965.65089OpenAlexW2118549893MaRDI QIDQ4508639
Publication date: 6 February 2001
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630560008816959
algorithmglobal convergencequadratic programmingKrylov subspace methodtrust region methodimplicitly restarted Lanczos method
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A second-order method for unconstrained optimization
- Truncated-Newton algorithms for large-scale unconstrained optimization
- Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
- Computing a Trust Region Step
- Hybrid Krylov Methods for Nonlinear Systems of Equations
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- Preconditioning of Truncated-Newton Methods
- The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems
- Newton’s Method with a Model Trust Region Modification
- Preconditioners for Indefinite Systems Arising in Optimization
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Safeguarded use of the implicit restarted lanczos technique for solving non‐linear structural eigensystems
- A Global Convergence Theory for the Celis–Dennis–Tapia Trust-Region Algorithm for Constrained Optimization
- A Theoretical Comparison of the Arnoldi and GMRES Algorithms
This page was built for publication: Implicitly restarted projection algorithm for solving optimization problems
