Quasi-Fejérian analysis of some optimization algorithms

Studies in Computational Mathematics

Volumn 8, Issue C, 2001, Pages 115-152

  Combettes, Patrick L ^a,b  

^a SORBONNE UNIVERSITÉ   (France)

^b CITY COLLEGE OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77956655101     PISSN: 1570579X     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S1570-579X(01)80010-0     Document Type: Chapter

References (72)

1. Agmon S. The relaxation method for linear inequalities. Canadian Journal of Mathematics 6 (1954) 382-392
2. Alber Ya.I., Iusem A.N., and Solodov M.V. On the projected subgradient method for non-smooth convex optimization in a Hilbert space. Mathematical Programming 81 (1998) 23-35
3. Alexandre P., Nguyen V.H., and Tossings P. The perturbed generalized proximal point algorithm. RAIRO Modélisation Mathématique et Analyse Numératique et Analyse Numérique 32 (1998) 223-253
4. A. A. Méthodes Numériques pour la Résolution des Problèmes d'Optimisation avec Contraintes. Doctoral thesis (1969), Université de Grenoble, France
5. Baillon J.-B. Comportement asymptotique des contractions et semi-groupes de contractions. Doctoral thesis (1978), Université Paris 6, France
6. Baillon J.-B., and G. H. Quelques propriétés des opérateurs angle-bornés et n-cycliquement monotones. Israel Journal of Mathematics 26 (1977) 137-150
7. H. H. Bauschke, Projection algorithms: Results and open problems, these proceedings.
8. Bauschke H.H., and Borwein J.M. On projection algorithms for solving convex feasibility problems. SIAM Review 38 (1996) 367-426
9. H. H. Bauschke and P. L. Combettes, A weak-to-strong convergence principles forFejér-monotone methods in Hilbert spaces, Mathematics of Operations Research to appear.
10. Bauschke H.H., Deutsch F., Hundal H., and Park S.H. Fejér monotonicity and weak convergence of an accelerated method of projections. In: Théra M. (Ed). Constructive Experimental, and Nonlinear Analysis (2000), Canadian Mathematical Society 1-6
11. Brègman L.M. The method of successive projection for finding a common point of convex sets. Soviet Mathematics-Doklady 6 (1965) 688-692
12. Brézis H., and Lions P.L. Produits infinis de résolvantes. Israel Journal of Mathematics 29 (1978) 329-345
13. Browder F.E. Convergence theorems for sequences of nonlinear operators in Banach spaces. Mathematische Zeitschrift 100 (1967) 201-225
14. Bruck R.E., and Reich S. Nonexpansive projections and resolvents of accretive operators in Banach spaces. Houston Journal of Mathematics 3 (1977) 459-470
15. Butnariu D., and Censor Y. Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces. Journal of Computational and Applied Mathematics 53 (1994) 33-42
16. Butnariu D., and Flm S.D. Strong convergence of expected-projection methods in Hilbert spaces. Numerical Functional Analysis and Optimization 16 (1995) 601-636
17. Y. C., and Lent A. Cyclic subgradient projections. Mathematical Programming 24 (1982) 233-235
18. Combettes P.L. Inconsistent signal feasibility problems: Least-squares solutions in a product space. IEEE Transactions on Signal Processing 42 (1994) 2955-2966
19. Combettes P.L. Construction d'un point fixe commun à une famille de contractions fermes. Comptes Rendus de l'Académie des Sciences de Paris I320 (1995) 1385-1390
20. P.L. C. The convex feasibility problem in image recovery. In: Hawkes P. (Ed). Advances in Imaging and Electron Physics 95 (1996) 155-270
21. Combettes P.L. Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projections. IEEE Transactions on Image Processing 6 (1997) 493-506
22. P.L. C. Hilbertian convex feasibility problem: Convergence of projection methods. Applied Mathematics and Optimization 35 (1997) 311-330
23. Combettes P.L. Strong convergence of block-iterative outer approximation methods for convex optimization. SIAM Journal on Control and Optimization 38 (2000) 538-565
24. Combettes P.L. Fejér-monotonicity in convex optimization. In: Floudas C.A., and Pardalos P.M. (Eds). Encyclopedia of Optimization (2001), Kluwer, Boston, MA
25. Combettes P.L., and Puh H. Extrapolated projection method for the euclidean convex feasibility problem, research report (1993), City University of New York
26. Correa R., and Lemaréchal C. Convergence of some algorithms for convex minimization. Mathematical Programming 62 (1993) 261-275
27. De Pierro A.R., and Iusem A.N. A parallel projection method for finding a common point of a family of convex sets. Pesquisa Operacional 5 (1985) 1-20
28. Eckstein J., and Bertsekas D.P. On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Mathematical Programming 55 (1992) 293-318
29. Eremin I.I. The relaxation method of solving systems of inequalities with convex functions on the left sides. Soviet Mathematics-Doklady 6 (1965) 219-222
30. Eremin I.I. Methods of Fejér approximations in convex programming. Mathematical Notes of the Academy of Sciences of the USSR 3 (1968) 139-149
31. Eremin I.I., and Mazurov V.D. Nonstationary Processes of Methamatical Programming (1979), Nauka, Moscow
32. Ermol'ev Yu.M. On the method of generalized stochastic gradients and quasi-Fejér sequences. Cybernetics 5 (1969) 208-220
33. Ermol'ev Yu.M. Stochastic quasigradient methods. In: Ermol'ev Yu., and Wets R.J.B. (Eds). Numerical Techniques for Stochastic Optimization (1988), Springer-Verlag, New York 141-185
34. translated in: American Mathematical Society Selected Translations in Mathematical Statistics and Probability 13 (1973) 143-148. Ermol'ev Yu.M., and Tuniev A.D. Random Fejér and quasi-Fejér sequences. Theory of Optimal Solutions-Akademiya Nauk Ukrainskoî SSR Kiev 2 (1968) 76-83
35. Flm S.D. Successive averages of firmly nonexpansive mappings. Mathematics of Operations Research 20 (1995) 497-512
36. García-Palomares U. Parallel-projected aggregation methods for solving the convex feasibility problem. SIAM Journal on Optimization 3 (1993) 882-900
37. García-Palomares U.M., and González-Castaño F.J. Incomplete projection algorithms for solving the convex feasibility problem. Numerical Algorithms 18 (1998) 177-193
38. Genel A., and Lindestrauss J. An example concerning fixed points. Israel Journal of Mathematics 22 (1975) 81-86
39. Goebel K., and Kirk W.A. Topics in Metric Fixed Point Theory (1990), Cambridge University Press, Cambridge
40. Groetsch C.W. A note on segmenting Mann iterates. Journal of Mathematical Analysis and Applications 40 (1972) 369-372
41. Gubin L.G., Polyak B.T., and Raik E.V. The method of projections for finding the common point of convex sets. USSR Computational Mathematics and Mathematical Physics 7 (1967) 1-24
42. Güler O. On the convergence of the proximal point algorithm for convex minimization. SIAM Journal on Control and Optimization 29 (1991) 403-419
43. Kiwiel K.C. Block-iterative surrogate projection methods for convex feasibility problems. Linear Algebra and Its Applications 215 (1995) 225-259
44. Kiwiel K.C. A projection-proximal bundle method for convex nondifferentiable minimization. In: Théra M., and Tichatschke R. (Eds). Ill-Posed Variational Problems and Regularization Techniques. Lecture Notes in Economics and Mathematical Systems 477 (1999), Springer-Verlag, New York 137-150
45. Kiwiel K.C., and Lopuch B. Surrogate projection methods for finding fixed points of firmly nonexpansive mappings. SIAM Journal on Optimization 7 (1997) 1084-1102
46. Lemaire B. Coupling optimization methods and variational convergence. In: Hoffmann K.H., Hiriart-Urruty J.B., Lemaréchal C., and Zowe J. (Eds). Trends in Mathematical Optimization. Schriftenreihe zur Numerischen Mathematik 84 (1988), Birkhäuser, Boston, MA 163-179
47. Lemaire B. Bounded diagonally stationary sequences in convex optimization. Journal of Convex Analysis 1 (1994) 75-86
48. Levitin E.S., and Polyak B.T. Constrained minimization methods. USSR Computational Mathematics and Mathematical Physics 6 (1966) 1-50
49. B. M. Algorithmes pour la Résolution de Problèmes d'Optimisation et de Minimax. Doctoral thesis (1972), Université de Grenoble, France
50. Martinet B. Détermination approchée d'un point fixe d'une application pseudocontractante. Cas de l'application prox. Comptes Rendus de l'Académie des Sciences de Paris A274 (1972) 163-165
51. Martinet B. Perturbation des méthodes d'optimisation-Applications. RAIRO Analyse Numérique 12 (1978) 153-171
52. Merzlyakov Y.I. On a relaxation method of solving systems of linear inequalities. USSR Computational Mathematics and Mathematical Physics 2 (1963) 504-510
53. Moreau J.J. Un cas de convergence des itérées d'une contraction d'un espace hilbertion. Comptes Rendus de l'Académie des Sciences de Paris A286 (1978) 143-144
54. Motzkin T.S., and Schoeberg I.J. The relaxation method for linear inequalities. Canadian Journal of Mathematics 6 (1954) 393-404
55. Nevanlinna O., and Reich S. Strong convergence of contraction semigroups and of iterative methods for accretive operators in Banach spaces. Israel Journal of Mathematics 32 (1979) 44-58
56. Ottavy N. Strong convergence of projection-like methods in Hilbert spaces. Journal of Optimization Theory and Applications 56 (1988) 433-461
57. Petryshyn W.V. Construction of fixed points of demicompact mappings in Hilbert space. Journal of Mathematical Analysis and Applications 14 (1966) 276-284
58. Petryshyn W.V., and Williamson T.E. Strong and weak convergence of the sequence of successive approximations for quasi-nonexpansive mappings. Journal of Mathematical Analysis and Applications 43 (1973) 459-497
59. Pierra G. Méthodes de projections parallèles extrapolées relatives à une intersection de convexes. Research report (1975), INPG, Grenoble, France
60. Pierra G. Decomposition through formalization in a product space. Mathematical Programming 28 (1984) 96-115
61. Pierra G., and Ottavy N. New parallel projection methods for linear varieties and applications, research report. presented at the XIIth International Symposium on Mathematical Programming. Tokyo (1988)
62. Polyak B.T. Minimization of unsmooth functionals. USSR Computational Mathematics and Mathematical Physics 9 (1969) 14-29
63. Raik E. Fejér type methods in Hilbert space. Eesti NSV Teaduste Akadeemia Toimetised-Füüsika-Matemaatika 16 (1967) 286-293
64. Raik E. A class of iterative methods with Fejér-monotone sequences. Eesti NSV Teaduste Akadeemia Toimetised-Füüsika-Matemaatika 18 (1969) 22-26
65. Reich S. Weak convergence theorems for nonexpansive mappings in Banach spaces. Journal of Mathematical Analysis and Applications 67 (1979) 274-276
66. Reich S. A limit theorem for projections. Linear and Multilinear Algebra 13 (1983) 281-290
67. Reich S., and Zaslavski A.J. Convergence of generic infinite products of nonexpansive and uniformly continuous operators. Nonlinear Analysis 36 (1999) 1049-1065
68. Rockafellar R.T. Monotone operators and the proximal point algorithm. SIAM Journal on Control and Optimization 14 (1976) 877-898
69. Schott D. Weak convergence of iterative methods generated by strongly Fejér monotone mappings. Rostocker Mathematisches Kolloquium 51 (1997) 83-96
70. Shor N.Z. Minimization Methods for Non-Differentiable Functions (1985), Springer-Verlag, New York
71. Solodov M.V., and Svaiter B.F. Forcing strong convergence of proximal point iterations in a Hilbert space. Mathematical Programming 87 (2000) 189-202
72. Tseng P. On the convergence of products of firmly nonexpansive mappings. SIAM Journal on Optimization 2 (1992) 425-434