A Framework for Analyzing Local Convergence Properties with Applications to Proximal-Point Algorithms
- 113 Downloads
A general algorithmic scheme for solving inclusions in a Banach space is investigated in respect to its local convergence behavior. Particular emphasis is placed on applications to certain proximal-point-type algorithms in Hilbert spaces. The assumptions do not necessarily require that a solution be isolated. In this way, results existing for the case of a locally unique solution can be extended to cases with nonisolated solutions. Besides the convergence rates for the distance of the iterates to the solution set, strong convergence to a sole solution is shown as well. As one particular application of the framework, an improved convergence rate for an important case of the inexact proximal-point algorithm is derived.
KeywordsInclusions generalized equations local convergence upper Lipschitz continuity nonisolated solutions proximal-point algorithms
Unable to display preview. Download preview PDF.