A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces

References

• Allgower E. L., Böhmer K., Potra F. A., Rheinboldt W. C. A mesh-independence principle for operator equations and their discretizations. SIAM J. Numer. Anal. (1986) 23:160–169Crossref, Google Scholar
• Argyros I. K. The asymptotic mesh independence principle for inexact Newton-Galerkin-like methods. Pure Math. Appl. (1997) 8:169–194Google Scholar
• Bauschke H. H. A norm convergence result on random products of relaxed projections in Hilbert space. Trans. Amer. Math. Soc. (1995) 347:1365–1373Crossref, Google Scholar
• Bauschke H. H., Borwein J. M. On projection algorithms for solving convex feasibility problems. SIAM Rev. (1996) 38:367–426Crossref, Google Scholar
• Bauschke H. H., Borwein J. M., Lewis A. S. The method of cyclic projections for closed convex sets in Hilbert space. Contemp. Math. (1997) 204:1–38Crossref, Google Scholar
• Borwein J., Fitzpatrick S., Vanderwerff J. Examples of convex functions and classifications of Banach spaces. J. Convex Anal. (1994) 1:61–73Google Scholar
• Borwein J., Reich S., Shafrir I. Krasnoselski-Mann iterations in normed spaces. Canad. Math. Bull. (1992) 35:21–28Crossref, Google Scholar
• Bregman L. M. The method of successive projection for finding a common point of convex sets. Soviet Math. Dokl. (1965) 6:688–692Google Scholar
• Brézis H.Opérateurs Maximaux Monotones et Semi-Groupes de Contractions dans les Espaces de Hilbert (1973) (North-Holland/Elsevier, New York) Google Scholar
• Brézis H., Lions P. L. Produits infinis de résolvantes. Israel J. Math. (1978) 29:329–345Crossref, Google Scholar
• Browder F. E. Convergence theorems for sequences of nonlinear operators in Banach spaces. Math. Z. (1967) 100:201–225Crossref, Google Scholar
• Bruck R. E., Reich S. Nonexpansive projections and resolvents of accretive operators in Banach spaces. Houston J. Math. (1977) 3:459–470Google Scholar
• Combettes P. L. Construction d'un point fixe commun à une famille de contractions fermes. C. R. Acad. Sci. Paris Sér. I Math. (1995) 320:1385–1390Google Scholar
• Combettes P. L., Hawkes P. The convex feasibility problem in image recovery. Advances in Imaging and Electron Physics (1996) 95(Academic Press, New York) 155–270Google Scholar
• Combettes P. L. Hilbertian convex feasibility problem: Convergence of projection methods. Appl. Math. Optim. (1997) 35:311–330Crossref, Google Scholar
• Combettes P. L. Strong convergence of block-iterative outer approximation methods for convex optimization. SIAM J. Control Optim. (2000) 38:538–565Crossref, Google Scholar
• Combettes P. L., Floudas C. A., Pardalos P. M. Fejér monotonicity in convex optimization. Encyclopedia of Optimization (2001) (Kluwer, Boston, MA) Google Scholar
• Dautray R., Lions J. L.Mathematical Analysis and Numerical Methods for Science and Technology (1988-1993) 1–6(Springer-Verlag, New York) Crossref, Google Scholar
• Dotson W. G. On the Mann iterative process. Trans. Amer. Math. Soc. (1970) 149:65–73Crossref, Google Scholar
• Fattorini H. O.Infinite–Dimensional Optimization and Control Theory (1999) (Cambridge University Press, Cambridge) Crossref, Google Scholar
• Genel A., Lindenstrauss J. An example concerning fixed points. Israel J. Math. (1975) 22:81–86Crossref, Google Scholar
• Goebel K., Kirk W. A.Topics in Metric Fixed Point Theory (1990) (Cambridge University Press, Cambridge, U.K.) Crossref, Google Scholar
• Gubin L. G., Polyak B. T., Raik E. V. The method of projections for finding the common point of convex sets. USSR Comput. Math. Math. Phys. (1967) 7:1–24Crossref, Google Scholar
• Güler O. On the convergence of the proximal point algorithm for convex minimization. SIAM J. Control Optim. (1991) 29:403–419Crossref, Google Scholar
• Haugazeau Y. Sur les inéquations variationnelles et la minimisation de fonctionnelles convexes. (1968) . Thèse, Université de Paris, Paris, FranceGoogle Scholar
• Khan M. A., Yannelis N. C.Equilibrium Theory in Infinite Dimensional Spaces (1991) (Springer-Verlag, New York) Crossref, Google Scholar
• Kiwiel K. C., Łopuch B. Surrogate projection methods for finding fixed points of firmly nonexpansive mappings. SIAM J. Optim. (1997) 7:1084–1102Crossref, Google Scholar
• Lions J. L., Temam R. Une méthode d'éclatement des opérateurs et des contraintes en calcul des variations. C. R. Acad. Sci. Paris Sér. A Math. (1966) 263:563–565Google Scholar
• Martinet B. Régularisation d'inéquations variationnelles par approximations successives. Rev. Française Inform. Rech. Opér. (1970) 4:154–158Google Scholar
• Măruşter Şt. The solution by iteration of nonlinear equations in Hilbert spaces. Proc. Amer. Math. Soc. (1977) 63:69–73Crossref, Google Scholar
• Moreau J. J. Un cas de convergence des itérées d'une contraction d'un espace hilbertien. C. R. Acad. Sci. Paris Sér. A Math (1978) 286:143–144Google Scholar
• Petryshyn W. V., Williamson T. E. Strong and weak convergence of the sequence of successive approximations for quasi-nonexpansive mappings. J. Math. Anal. Appl. (1973) 43:459–497Crossref, Google Scholar
• Polyak B. T. Minimization of unsmooth functionals. USSR Comput. Math. Math. Phys. (1969) 9:14–29Crossref, Google Scholar
• Raik E. A class of iterative methods with Fejér-monotone sequences. Eesti NSV Tead. Akad. Toimetised Füüs.-Mat. (1969) 18:22–26Google Scholar
• Reich S. On infinite products of resolvents. Atti Accad. Naz. Lincei Rend. Cl. Sci. Fis. Mat. Natur. ser. VIII (1977) 63:338–340Google Scholar
• Rockafellar R. T. Monotone operators and the proximal point algorithm. SIAM J. Control Optim. (1976) 14:877–898Crossref, Google Scholar
• Solodov M. V., Svaiter B. F. Forcing strong convergence of proximal point iterations in a Hilbert space. Math. Programming (2000) 87:189–202Crossref, Google Scholar
• Vanderlugt A.Optical Signal Processing (1992) (Wiley, New York) Google Scholar