A weak-to-strong convergence principle for Fejér-monotone methods in Hilbert spaces

Mathematics of Operations Research

Volumn 26, Issue 2, 2001, Pages 248-264

  Bauschke, H H ^a   Combettes, P L ^a  

^a OKANAGAN UNIVERSITY COLLEGE   (Canada)

Author keywords

Convex feasibility; Fej r monotonicity; Firmly nonexpansive mapping; Fixed point; Haugazeau; Maximal monotone operator; Projection; Proximal point algorithm; Resolvent; Subgradient algorithm

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; OPTIMIZATION; SET THEORY;

HILBERT SPACES;

CONVERGENCE OF NUMERICAL METHODS;

EID: 0035351666     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.26.2.248.10558     Document Type: Article

References (38)

1. A mesh-independence principle for operator equations and their discretizations
2. The asymptotic mesh independence principle for inexact Newton-Galerkin-like methods
3. A norm convergence result on random products of relaxed projections in Hilbert space
4. On projection algorithms for solving convex feasibility problems
5. The method of cyclic projections for closed convex sets in Hilbert space
6. Examples of convex functions and classifications of Banach spaces
7. Krasnoselski-Mann iterations in normed spaces
8. The method of successive projection for finding a common point of convex sets
9. Produits infinis de résolvantes
10. Convergence theorems for sequences of nonlinear operators in Banach spaces
11. Nonexpansive projections and resolvents of accretive operators in Banach spaces
12. Construction d'un point fixe commun à une famille de contractions fermes
13. The convex feasibility problem in image recovery
14. Hilbertian convex feasibility problem: Convergence of projection methods
15. Strong convergence of block-iterative outer approximation methods for convex optimization
16. Fejér monotonicity in convex optimization
17. On the Mann iterative process
18. An example concerning fixed points
19. The method of projections for finding the common point of convex sets
20. On the convergence of the proximal point algorithm for convex minimization
21. Surrogate projection methods for finding fixed points of firmly nonexpansive mappings
22. Une méthode d'éclatement des opérateurs et des contraintes en calcul des variations
23. Régularisation d'inéquations variationnelles par approximations successives
24. The solution by iteration of nonlinear equations in Hilbert spaces
25. Un cas de convergence des itérées d'une contraction d'un espace hilbertien
26. Strong and weak convergence of the sequence of successive approximations for quasi-nonexpansive mappings
27. Minimization of unsmooth functionals
28. A class of iterative methods with Fejér-monotone sequences
29. On infinite products of resonants
30. Monotone operators and the proximal point algorithm
31. Forcing strong convergence of proximal point iterations in a Hilbert space