Journal
JOURNAL OF APPROXIMATION THEORY
Volume 106, Issue 2, Pages 226-240Publisher
ACADEMIC PRESS INC
DOI: 10.1006/jath.2000.3493
Keywords
maximal monotone operator; resolvent; proximal point algorithm; iteration; strong convergence; weak convergence
Categories
Ask authors/readers for more resources
Let H he a real Hilbert space and let T:H --> 2(H) he a maximal monotone operator. In this paper, we first introduce two algorithms of approximating solutions of maximal monotone operators. One of them is to generate a strongly convergent sequence with limit v epsilon T(-1)0. The other is to discuss the weak convergence of the proximal point algorithm. Next, using these results, we consider the problem of finding a minimizer of a convex function. Our methods are motivated by Halpern's iteration and Mann's iteration. (C) 2000 Academic Press.
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