A note on the iterative algorithm for large sparse saddle point problems
From MaRDI portal
Publication:2371416
DOI10.1016/j.amc.2006.09.103zbMath1118.65321OpenAlexW2368544179MaRDI QIDQ2371416
Publication date: 4 July 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.09.103
Related Items
On the iterative algorithm for saddle point problems ⋮ A quadratic objective penalty function for bilevel programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum residual methods for augmented systems
- Block SOR methods for rank-deficient least-squares problems
- On the iterative algorithm for large sparse saddle point problems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Preconditioners for Indefinite Systems Arising in Optimization
- Inexact and Preconditioned Uzawa Algorithms for Saddle Point Problems
- Fast Nonsymmetric Iterations and Preconditioning for Navier–Stokes Equations
- SOR-like methods for augmented systems
This page was built for publication: A note on the iterative algorithm for large sparse saddle point problems
