𝔖 Bobbio Scriptorium
✦   LIBER   ✦

on hybrid preconditioning methods for large sparse saddle-point problems

✍ Scribed by Zeng-Qi Wang

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
239 KB
Volume
434
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On preconditioned Uzawa methods and SOR
On preconditioned Uzawa methods and SOR methods for saddle-point problems
✍ Xiaojun Chen πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 776 KB

This paper studies convergence analysis of a preconditioned inexact Uzawa method for nondifferentiable saddle-point problems. The SOR-Newton method and the SOR-BFGS method are special cases of this method. We relax the Bramble-Pasciak-Vassilev condition on preconditioners for convergence of the inex

Preconditioned GMRES methods with incomp
Preconditioned GMRES methods with incomplete Givens orthogonalization method for large sparse least-squares problems
✍ Jun-Feng Yin; Ken Hayami πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 581 KB

We propose to precondition the GMRES method by using the incomplete Givens orthogonalization (IGO) method for the solution of large sparse linear least-squares problems. Theoretical analysis shows that the preconditioner satisfies the sufficient condition that can guarantee that the preconditioned G

Indefinitely preconditioned inexact Newt
Indefinitely preconditioned inexact Newton method for large sparse equality constrained non-linear programming problems
✍ Ladislav LukΕ‘an; Jan Vlček πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 195 KB πŸ‘ 2 views

An inexact Newton algorithm for large sparse equality constrained non-linear programming problems is proposed. This algorithm is based on an indefinitely preconditioned smoothed conjugate gradient method applied to the linear KKT system and uses a simple augmented Lagrangian merit function for Armij

Indefinitely preconditioned conjugate gr
Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems
✍ C. Durazzi; V. Ruggiero πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 144 KB

## Abstract This paper is concerned with the numerical solution of a symmetric indefinite system which is a generalization of the Karush–Kuhn–Tucker system. Following the recent approach of LukΕ‘an and Vlček, we propose to solve this system by a preconditioned conjugate gradient (PCG) algorithm and