Steepest descent preconditioning for nonlinear GMRES optimization
DOI10.1002/nla.1837zbMath1313.65137arXiv1106.4426OpenAlexW2111507332MaRDI QIDQ2931517
Publication date: 25 November 2014
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1106.4426
convergencenumerical resultspreconditioningnonlinear optimizationconjugate gradient methodleast squaressteepest descentBFGS methodconjugate gradientquadratic programline-searchgeneralized minimal residual (GMRES) methodBroyden-Fletcher-Goldfarb-Shanno methodBroyden-Fletcher-Goldfarb-Shanno
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)
Related Items (7)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Krylov subspace acceleration for nonlinear multigrid schemes
- On multigrid for linear complementarity problems with application to American-style options
- A Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition
- Two classes of multisecant methods for nonlinear acceleration
- Anderson Acceleration for Fixed-Point Iterations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Extrapolation Methods for Vector Sequences
- Testing Unconstrained Optimization Software
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Line search algorithms with guaranteed sufficient decrease
- Krylov Subspace Acceleration of Nonlinear Multigrid with Application to Recirculating Flows
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
This page was built for publication: Steepest descent preconditioning for nonlinear GMRES optimization