Surrogate projection methods for finding fixed points of firmly nonexpansive mappings

SIAM Journal on Optimization

Volumn 7, Issue 4, 1997, Pages 1084-1102

  Kiwiel, Krzysztof C ^a   Lopuch, Bozena ^a  

^a SYSTEMS RESEARCH INSTITUTE   (Poland)

Author keywords

Convex feasibility problems; Firmly nonexpansive mappings; Relaxation methods; Successive projections; Surrogate inequalities

Indexed keywords

EID: 0031285686     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623495279569     Document Type: Article

References (30)

1. J. -P. AUBIN AND I. EKELAND, Applied Nonlinear Analysis, Wiley, New York, 1984.
2. H. H. BAUSCHKE AND J. M. BORWEIN, On projection algorithms for solving convex feasibility problems, SIAM Rev., 38 (1996), pp. 367-426.
3. R. E. BRUCK, JR. AND S. REICH, Nonexpansive projections and resolvents of accretive operators m Banach spaces, Houston J. Math., 3 (1977), pp. 459-470.
4. P. L. COMBETTES, Construction d'un point fixe commun á une famille de contractions fermes, C. R. Acad. Sci. Paris, Sér. I Math., 320 (1995), pp. 1385-1390.
5. P. L. COMBETTES, Convex Set Theoretic Image Recovery by Extrapolated Iterations of Parallel Subgradient Projections, Tech. report, Dept. of Electrical Eng., City College and Graduate School, City Univ. of New York, New York, 1995.
6. P. L. COMBETTES, Hilbertian convex feasibility problem: Convergence of projection methods, Appl. Math. Optim., 35 (1997), pp. 311-330.
7. J. ECKSTEIN AND D. P. BERTSEKAS, On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators, Math. Programming, 55 (1992), pp. 293-318.
8. J. ECKSTEIN, Splitting Methods for Monotone Operators with Applications to Parallel Optimization, Ph.D. thesis, Department of Civil Engineering, Massachusetts Institute of Technology, Cambridge, MA, June 1989. Report LIDS-TH-1877, Laboratory for Information and Decision Sciences, MIT.
9. S. D. FLÅM, Successive averages of firmly nonexpansive mappings, Math. Oper. Res., 20 (1995), pp. 497-512.
10. K. GOEBEL AND S. REICH, EDS., Uniform Convexity, Hyperbolic Geometry and Nonexpansive Mappings, Marcel Dekker, New York, 1984.
11. U. GARCÍA-PALOMARES, Parallel projected aggregation methods for solving the convex feasibility problem, SIAM J. Optim., 3 (1993), pp. 882-900.
12. L. G. GURIN, B. T. POLYAK, AND E. V. RAIK, The method of projections for finding a common point of convex sets, Zh. Vychisl. Mat. i Mat. Fiz., 7 (1967), pp. 1211-1228 (in Russian). English transl. in U. S. S. R. Comput. Math, and Math. Phys., 7 (1967), pp. 1-24.
13. L. G. GURIN, B. T. POLYAK, AND E. V. RAIK, The method of projections for finding a common point of convex sets, Zh. Vychisl. Mat. i Mat. Fiz., 7 (1967), pp. 1211-1228 (in Russian). English transl. in U. S. S. R. Comput. Math, and Math. Phys., 7 (1967), pp. 1-24.
14. A. J. HOFFMAN, On approximate solutions of systems of linear inequalities, J. Res. Nat. Bur. Standards, 49 (1952), pp. 263-265.
15. A. D. IOFFE AND V. M. TIKHOMIROV, Theory of Extremal Problems, Nauka, Moscow, 1974 (in Russian). English transl., North-Holland, Amsterdam, 1979.
16. K. C. KIWIEL AND B. ŁOPUCH, Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings, Tech. report, Systems Research Institute, Warsaw, November 1994. Revised January 1996.
17. K. C. KIWIEL, A Cholesky dual method for proximal piecewise linear programming, Numer. Math., 68 (1994), pp. 325-340.
18. K. C. KIWIEL, Block-iterative surrogate projection methods for convex feasibility problems, Linear Algebra Appl., 215 (1995), pp. 225-260.
19. K. C. KIWIEL, The efficiency of subgradient projection methods for convex optimization, part I: General level methods, SIAM J. Control Optim., 34 (1996), pp. 660-676.
20. K. C. KIWIEL, The efficiency of subgradient projection methods for convex optimization, part II: Implementations and extensions, SIAM J. Control Optim., 34 (1996), pp. 677-697.
21. K. C. KIWIEL, Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems, Linear Algebra Appl., 252 (1997), pp. 27-33.
22. P. J. LAURENT, Approximation et Optimisation, Hermann, Paris, 1972.
23. YU. I. MERZLYAKOV, On a relaxation method of solving systems of linear inequalities, Zh. Vychisl. Mat. i Mat. Fiz., 2 (1962), pp. 482-487 (in Russian). English transl. in U. S. S. R. Comput. Math, and Math. Phys., 2 (1962), pp. 504-510.
24. YU. I. MERZLYAKOV, On a relaxation method of solving systems of linear inequalities, Zh. Vychisl. Mat. i Mat. Fiz., 2 (1962), pp. 482-487 (in Russian). English transl. in U. S. S. R. Comput. Math, and Math. Phys., 2 (1962), pp. 504-510.
25. W. OETTLI, Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints, Approx. Theory Appl., 14 (1975), pp. 43-50.
26. Z. OPIAL, Weak convergence of the sequence of successive approximations for nonexpansive mappings, Bull. Amer. Math. Soc. (N.S.), 73 (1967), pp. 591-597.
27. R. R. PHELPS, Convex Functions, Monotone Operators and Differentiability, second ed., Lecture Notes in Mathematics 1364, Springer-Verlag, Berlin, 1993.
28. R. T. ROCKAFELLAR, Monotone operators and the proximal point algorithm, SIAM J. Control Optim., 14 (1976), pp. 877-898.
29. A. G. SUKHAREV, A. V. TIMOKHOV, AND V. V. FEDOROV, A Course on Optimization Methods, Nauka, Moscow, 1986 (in Russian).
30. P. TSENG, On the convergence of the products of firmly nonexpansive maps, SIAM J. Optim., 2 (1992), pp. 425-434.