Using constraint preconditioners with regularized saddle-point problems
From MaRDI portal
Publication:2643616
DOI10.1007/s10589-006-9004-xzbMath1124.65033MaRDI QIDQ2643616
Andrew J. Wathen, Nicholas I. M. Gould, Wil H. A. Schilders, H. S. Dollar
Publication date: 27 August 2007
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://purl.org/net/epubs/manifestation/5852/RAL-TR-2005-026.pdf
65F10: Iterative numerical methods for linear systems
65F35: Numerical computation of matrix norms, conditioning, scaling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Preconditioning indefinite systems in interior point methods for optimization
- On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems
- The Quadratic Eigenvalue Problem
- On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization
- On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions
- Block preconditioners for symmetric indefinite linear systems
- Numerical solution of saddle point problems
- Iterative Solution of Augmented Systems Arising in Interior Methods
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Constraint Preconditioning for Indefinite Linear Systems
- Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning
- Any Nonincreasing Convergence Curve is Possible for GMRES
- Constraint-Style Preconditioners for Regularized Saddle Point Problems
- CUTEr and SifDec
