๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On convergence rate of the augmented Lagrangian algorithm for nonsymmetric saddle point problems

โœ Scribed by G.M. Awanou; M.J. Lai


Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
148 KB
Volume
54
Category
Article
ISSN
0168-9274

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On the convergence analysis of inexact h
โœ Lu-Chuan Ceng; Jen-Chih Yao ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 192 KB

In this paper we introduce general iterative methods for finding zeros of a maximal monotone operator in a Hilbert space which unify two previously studied iterative methods: relaxed proximal point algorithm [H.K. Xu, Iterative algorithms for nonlinear operators, J. London Math Soc. 66 (2002) 240-25