General framework for the generalized proximal point algorithm, based on the notion of (H, η) − monotonicity, is developed. The linear convergence analysis for the generalized proximal point algorithm to the context of solving a class of nonlinear variational inclusions is examined, The obtained results generalize and unify a wide range of problems to the context of achieving the linear convergence for proximal point algorithms.
@article{1368,
title = {Linear Convergence Analysis for General Proximal Point Algorithms Involving (H, e) - Monotonicity Frameworks},
journal = {CUBO, A Mathematical Journal},
volume = {13},
year = {2011},
language = {en},
url = {http://dml.mathdoc.fr/item/1368}
}
Verma, Ram U. Linear Convergence Analysis for General Proximal Point Algorithms Involving (H, η) − Monotonicity Frameworks. CUBO, A Mathematical Journal, Tome 13 (2011) . http://gdmltest.u-ga.fr/item/1368/