A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space

Journal of Approximation Theory

Volumn 141, Issue 1, 2006, Pages 63-69

  Bauschke, Heinz H ^a   Combettes, Patrick L ^b   Luke, D Russell ^c  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^c UNIVERSITY OF DELAWARE   (United States)

Author keywords

Best approximation problem; Convex set; Projection; Strong convergence

Indexed keywords

EID: 33745856582     PISSN: 00219045     EISSN: 10960430     Source Type: Journal    
DOI: 10.1016/j.jat.2006.01.003     Document Type: Article

References (9)

1. Aubin J.-P. Optima and Equilibria. second ed. (1998), Springer, Berlin
2. Bauschke H.H., and Combettes P.L. A weak-to-strong convergence principle for Fejér-monotone methods in Hilbert spaces. Math. Oper. Res. 26 (2001) 248-264
3. Bauschke H.H., Combettes P.L., and Luke D.R. Phase retrieval, error reduction algorithm, and Fienup variants: a view from convex optimization. J. Opt. Soc. Amer. A 19 (2002) 1334-1345
4. Bauschke H.H., Combettes P.L., and Luke D.R. Finding best approximation pairs relative to two closed convex sets in Hilbert spaces. J. Approx. Theory 127 (2004) 178-192
5. Deutsch F. Best Approximation in Inner Product Spaces (2001), Springer, New York
6. Goebel K., and Kirk W.A. Topics in Metric Fixed Point Theory (1990), Cambridge University Press, Cambridge
7. Y. Haugazeau, Sur les Inéquations Variationnelles et la Minimisation de Fonctionnelles Convexes, Thèse, Université de Paris, France, 1968.
8. Lions P.L., and Mercier B. Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16 (1979) 964-979
9. Pierra G. Éclatement de contraintes en parallèle pour la minimisation d'une forme quadratique. Lecture Notes in Computer Science vol. 41 (1976), Springer, New York 200-218