Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces

Journal of Approximation Theory

Volumn 124, Issue 2, 2003, Pages 194-218

  Bregman, Lev M ^a   Censor, Yair ^b   Reich, Simeon ^c   Zepkowitz Malachi, Yael ^b  

^a Institute for Industrial Mathematics Israel   (Israel)

^b UNIVERSITY OF HAIFA   (Israel)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Convex set; Dykstra's algorithm; Half space; Projection

Indexed keywords

EID: 0344586000     PISSN: 00219045     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jat.2003.08.004     Document Type: Article

References (41)

1. R. Aharoni, A. Berman, Y. Censor, An interior points algorithm for the convex feasibility problem, Adv. Appl. Math. 4 (1983) 479-489.
2. H.H. Bauschke, The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space, J. Math. Anal. Appl. 202 (1996) 150-159.
3. H.H. Bauschke, J.M. Borwein, Dykstra's alternating projection algorithm for two sets, J. Approx. Theory 79 (1994) 418-443.
4. H.H. Bauschke, J.M. Borwein, On projection algorithms for solving convex feasibility problems, SIAM Rev. 38 (1996) 367-426.
5. H.H. Bauschke, J.M. Borwein, Legendre functions and the method of random Bregman projections, J. Convex Anal. 4 (1997) 27-67.
6. H.H. Bauschke, P.L. Combettes, A weak-to-strong convergence principle for Fejér-monotone methods in Hilbert spaces, Math. Oper. Res. 26 (2001) 248-264.
7. H.H. Bauschke, P.L. Combettes, Construction of best Bregman approximations in reflexive Banach spaces, Proc. Amer. Math. Soc. 131 (2003) 3757-3766.
8. H.H. Bauschke, A.S. Lewis, Dykstra's algorithm with Bregman projections: a convergence proof, Optimization 48 (2000) 409-427.
9. J.P. Boyle, R.L. Dykstra, A method of finding projections onto the intersection of convex sets in Hilbert spaces, in: Advances in Order Restricted Statistical Inference, Lecture Notes in Statistics, Vol. 37, Springer, Berlin, Germany, 1986, pp. 28-47.
10. L.M. Bregman, The relaxation method of finding the common point of convex sets and its application to the Solution of problems in convex programming, USSR Comput. Math. Math. Phys. 7 (1967) 200-217.
11. L.M. Bregman, Y. Censor, S. Reich, Dykstra's algorithm as the nonlinear extension of Bregman's optimization method, J. Convex Analysis 6 (1999) 319-333.
12. Y. Censor, A. Lent, An iterative row-action method for interval convex programming, J. Optim. Theory Appl. 34 (1981) 321-353.
13. Y. Censor, S. Reich, The Dykstra algorithm with Bregman projections, Comm. Appl. Anal. 2 (1998) 407-419.
14. Y. Censor, S.A. Zenios, Parallel Optimization: Theory, Algorithms, and Applications, Oxford University Press, New York, NY, USA, 1997.
15. P.L. Combettes, Signal recovery by best feasible approximation, IEEE Trans. Image Process. IP-2 (1993) 269-271.
16. P.L. Combettes, Strong convergence of block-iterative outer approximation methods for convex optimization, SIAM J. Control Optim. 38 (2000) 538-565.
17. G. Crombez, Finding projections onto the intersection of convex sets in Hilbert spaces, Numer. Funct. Anal. Optim. 16 (1995) 637-652.
18. D.A. D'Esopo, A convex programming procedure, Naval Res. Logistics Quart. 6 (1959) 33-42.
19. F. Deutsch, Best Approximation in Inner Product Spaces, Springer, New York, NY, USA, 2001.
20. F. Deutsch, H. Hundal, The rate of convergence of Dykstra's cyclic projections algorithm: the polyhedral case, Numer. Funct. Anal. Optim. 15 (1994) 537-565.
21. R.L. Dykstra, An algorithm for restricted least squares regression, J. Amer. Statist. Assoc. 78 (1983) 837-842.
22. R.L. Dykstra, An iterative procedure for obtaining I-projections onto the intersection of convex sets, Ann. Probab. 13 (1985) 975-984.
23. M. Fukushima, An outer approximation algorithm for solving general convex programs, Oper. Res. 31 (1983) 101-113.
24. M. Fukushima, A relaxed projection method for variational inequalities, Math. Programing 35 (1986) 58-70.
25. N. Gaffke, R. Mathar, A cyclic projection algorithm via duality, Metrika 36 (1989) 29-54.
26. S.-P. Han, A successive projection method, Math. Programming 40 (1988) 1-14.
27. S.-P. Han, G. Lou, A parallel algorithm for a class of convex programs, SIAM J. Control Optim. 26 (1988) 345-355.
28. Y. Haugazeau, Sur les Inéquations Variationnelles et la Minimisation de Fonctionnelles Convexes, Ph.D. Thesis, Université de Paris, Paris, France, 1968.
29. C. Hildreth, A quadratic programming procedure, Naval Res. Logistics Quart. 4 (1957) 79-85 (Erratum, ibid., p. 361).
30. H. Hundal, F. Deutsch, Two generalizations of Dykstra's cyclic projections algorithm, Math. Programming 77 (1997) 335-355.
31. A.N. Iusem, A.R. De Pierro, A simultaneous iterative method for computing projections on polyhedra, SIAM J. Control Optim. 25 (1987) 231-243.
32. A. N. Iusem, A.R. De Pierro, On the convergence of Han's method for convex programming with quadratic objective, Math. Programming 52 (1991) 265-284.
33. A.N. Iusem, B.F. Svaiter, A row-action method for convex programming, Math. Programming 64 (1994) 149-171.
34. A. N. Iusem, B.F. Svaiter, Primal-dual row-action method for convex programming, J. Optim. Theory Appl. 86 (1995) 73-112.
35. A. Lent, Y. Censor, Extensions of Hildreth's row-action method for quadratic programming, SIAM J. Control Optim. 18 (1980) 444-454.
36. D.G. Luenberger, Optimization by Vector Space Methods, Wiley, New York, NY, USA, 1969.
37. G. Pierra, Eclatement de contraintes en parallèle pour la minimisation d'une forme quadratique, in: Lecture Notes in Computer Science, Vol. 41, Springer, New York, NY, USA, 1976, pp. 96-115.
38. G. Pierra, Decomposition through formalization in a product space, Math. Programming 28 (1984) 96-115.
39. R.T. Rockafellar, Convex Analysis, Princeton University Press, Princeton, NJ, USA, 1970.
40. 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.
41. P. Tseng, Dual coordinate ascent methods for non-strictly convex minimization, Math. Programming 59 (1993) 231-247.