𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the convergence of multiplicative iterative algorithms with inexact line search

✍ Scribed by Xiaoguang Yang

Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
1997
Tongue
English
Weight
285 KB
Volume
13
Category
Article
ISSN
0168-9673

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Accelerating the Convergence of Nonli
On Accelerating the Convergence of Nonlinear Iterative Algorithms
✍ D.W. Black; A.P. Rothmayer πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 505 KB

The underlying theory of vector sequence extrapolation methods for linear and nonlinear problems is examined. It is shown that nonlinearity limits savings in total number of iterations to \(50 \%\) for strongly nonlinear problems when linear-based extrapolation methods are used. In support of this c

Effects of Asynchronism on the Convergen
Effects of Asynchronism on the Convergence Rate of Iterative Algorithms
✍ Aydin Üresin; Michel Dubois πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 392 KB

In multiprocessor systems, iterative algorithms can be implemented synchronously or asynchronously. Unfortunately, few guidelines exist to make a choice. In this paper, we compare the execution times of an asynchronous iterative algorithm and of its synchronous counterpart. Synchronization overhead

On the convergence analysis of inexact h
On the convergence analysis of inexact hybrid extragradient proximal point algorithms for maximal monotone operators
✍ 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