Journal
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
Volume 219, Issue 1, Pages 223-236Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.cam.2007.07.021
Keywords
speeding up method; common fixed point; convex optimization; subgradient projection; heavy ball dynamical system; inertial algorithm; convex feasibility
Categories
Ask authors/readers for more resources
This paper deals with the convergence analysis of a general fixed point method which unifies KM-type (Krasnoselskii-Mann) iteration and inertial type extrapolation. This strategy is intended to speed LIP the convergence of algorithms in signal processing and image reconstruction that can be formulated as KM iterations. The convergence theorems established in this new setting improve known ones and some applications are given regarding convex feasibility problems, subgradient methods, fixed point problems and monotone inclusions. (C) 2007 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available