Steered sequential projections for the inconsistent convex feasibility problem

Nonlinear Analysis, Theory, Methods and Applications

Volumn 59, Issue 3, 2004, Pages 385-405

  Censor, Yair ^a   De Pierro, Alvaro R ^b   Zaknoon, Maroun ^a,c  

^a UNIVERSITY OF HAIFA   (Israel)

^b UNIVERSITY OF CAMPINAS   (Brazil)

^c UNIVERSITY OF INDIANAPOLIS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; ITERATIVE METHODS; SET THEORY;

BREGMAN DISTANCES; CONVEX FUNCTIONS; ORTHOGONAL PROJECTIONS; PROJECTION ALGORITHMS;

PROBLEM SOLVING;

EID: 4944234573     PISSN: 0362546X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.na.2004.07.018     Document Type: Article

References (32)

1. R. Aharoni, Y. Censor, Block-iterative projection methods for parallel computation of solutions to convex feasibility problems, Linear Algebra Appl. 120 (1989) 165-175.
2. R. Aharoni, P. Duchet, B. Wajnryb, Successive projections on hyperplanes, J. Math. Anal. Appl. 103 (1984) 134-138.
3. J.-P. Aubin, A. Cellina, Differential Inclusions, Springer, Berlin, Germany, 1984.
4. H.H. Bauschke, The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space, J. Math. Anal. Appl. 202 (1996) 150-159.
5. H.H. Bauschke, J.M. Borwein, On projection algorithms for solving convex feasibility problems, SIAM Rev. 38 (1996) 367-426.
6. H.H. Bauschke, J.M. Borwein, Legendre functions and the method of random Bregman projections, J. Convex Anal. 4 (1997) 27-67.
7. H.H. Bauschke, J.M. Borwein, Joint and separate convexity of Bregman distance, in: D. Butnariu, Y. Censor, S. Reich (Eds.), Inherently Parallel Algorithms in Feasibility and Optimization and their Applications, (Haifa 2000), Elsevier Science, Amsterdam, The Netherlands, 2001, pp. 23-36.
8. D.P. Bertsekas, Nonlinear Programming, Athena Scientific, Belmont, MA, USA, 1995.
9. D.P. Bertsekas, A new class of incremental gradient methods for least squares problems, SIAM J. Optim. 7 (1997) 913-926.
10. D.P. Bertsekas, J.N. Tsitsiklis, Gradient convergence in gradient methods, SIAM J. Optim. 36 (2000) 627-642.
11. L.M. Bregman, The method of successive projections for finding a common point of convex sets, Sov. Math. Dokl. 6 (1965) 688-692.
12. C. Byme, Y. Censor, Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback-Leibler distance minimization, Ann. Oper. Res. 105 (2001) 77-98.
13. Y. Censor, P.P.B. Eggermont, D. Gordon, Strong underrelaxation in Kaczmarz's method for inconsistent systems, Numer. Math. 41 (1983) 83-92.
14. Y. Censor, S.A. Zenios, Parallel Algorithms: Theory, Algorithms, and Applications, Oxford University Press, New York, NY, USA, 1997.
15. W. Cheney, Analysis for Applied Mathematics, Springer, New York, USA, 2002.
16. P.L. Combettes, Inconsistent signal feasibility: least-squares solutions in a product space, IEEE Trans. Signal Process. SP-42 (1994) 2955-2966.
17. P.L. Combettes, The convex feasibility problem in image recovery, in: P.W. Hawkes (Ed.), Advances in Imaging and Electron Physics, Academic Press, New York, NY, USA, 1996, pp. 155-270.
18. A.R. De Pierro, From parallel to sequential projection methods and vice versa in convex feasibility: results and conjectures, in: D. Butnariu, Y. Censor, S. Reich (Eds.), Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, Elsevier Science Publishers, Amsterdam, The Netherlands, 2001, pp. 187-201.
19. F. Deutsch, I. Yamada, Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings, Numer. Funct. Anal. Optim. 19 (1998) 33-56.
20. J. Eckstein, Approximate iterations in Bregman-function-based proximal algorithms, Math. Programming 83 (1998) 113-123.
21. J. Eckstein, A practical general approximation criterion for methods of multipliers based on Bregman distances, Math. Programming Ser. A 96 (2003) 61-86.
22. L. Gubin, B. Polyak, E. Raik, The method of projections for finding the common point of convex sets, USSR Comput Math. Math. Phys. 7 (1967) 1-24.
23. P.-L. Lions, Approximation de points fixes de contractions, C. R. Acad. Sci. Paris Sér. A-B 284 (1977) A1357-A1359.
24. R. Meshulam, On products of projections, Discrete Math. 154 (1996) 307-310.
25. A. Nedić, D.P. Bertsekas. Incremental subgradient methods for non-differentiable optimization, SIAM J Optim. 12 (2001) 109-138.
26. S. Reich, Approximating fixed points of holomorphic mappings, Math Japon. 37 (1992) 457-459.
27. S. Reich, Approximating fixed points of nonexpansive mappings, Panamerican Math. J. 4 (1994) 23-28.
28. T. Rockaffellar, Convex Analysis, Princeton University Press, Princeton, NJ, USA, 1972.
29. M.V. Solodov, B.F. Svaiter, An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions, Math. Oper. Res 25 (2000) 214-230.
30. H. Stark, Y. Yang, Vector Space Projections: A Numerical Approach to Signal and Image Processing, Neural Nets, and Optics, Wiley, New York, NY, USA, 1998
31. R. Wittmann, Approximation of fixed points of nonexpansive mappings, Arch. Math. 58 (1992) 486-491.
32. M. Zaknoon, Algorithmic developments for the convex feasibility problem. Ph.D. Thesis, Department of Mathematics, University of Haifa, April 2003, 73pp.