Dykstra's algorithm as the nonlinear extension of Bregman's optimization method

Journal of Convex Analysis

Volumn 6, Issue 2, 1999, Pages 319-333

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

^a Institute for Industrial Mathematics Israel   (Israel)

^b UNIVERSITY OF HAIFA   (Israel)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Bregman projection; Convex programming; Dykstra's algorithm

Indexed keywords

EID: 22844453400     PISSN: 09446532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (46)

1. H. H. Bauschke, J. M. Borwein: Dykstra's alternating projection algorithm for two sets, Journal of Approximation Theory 79 (1994) 418-443.
2. H. H. Bauschke, J. M. Borwein: On projection algorithms for solving convex feasibility problems, SIAM Review 38 (1996) 367-426.
3. H. H. Bauschke, J. M. Borwein: Legendre functions and the method of random Bregman projections, Journal of Convex Analysis 4 (1997) 27-67.
4. H. H. Bauschke, A. S. Lewis: Dykstra's algorithm with Bregman projections: a convergence proof, Technical Report, Dept. of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, N2L3G1, Canada, June 1998. Optimization, accepted for publication.
5. J. P. Boyle, R. L. Dykstra: A method for finding projections onto the intersection of convex sets in Hubert spaces, In: Advances in Order Restricted Statistical Inference, Lecture Notes in Statistics, Springer-Verlag, Berlin, Germany, Volume 37 (1986) 28-47.
6. 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 Computational Mathematics and Mathematical Physics 7 (1967) 200-217.
7. L. M. Bregman, N. I. Naumova: Arbitration solutions with ideal point generated by systems of functions, Soviet Mathematics Doklady 30 (1984) 583-587.
8. R. S. Burachik, S. Scheimberg: A proximal point method for the variational inequality problem in Banach spaces, Technical Report ES-470, COPPE-UFRJ, Rio de Janeiro, Brazil, June 1998.
9. Y. Censor: Row-action methods for huge and sparse systems and their applications, SIAM Review 23 (1981) 444-466.
10. Y. Censor, T. Elfving: A multiprojection algorithm using Bregman projections in a product space, Numerical Algorithms 8 (1994) 221-239.
11. Y. Censor, A. N. Iusem, S. A. Zenios: An interior point method with Bregman functions for the variational inequality problem with paramonotone operators, Mathematical Programming 81 (1998) 373-400.
12. Y. Censor, A. Lent: An iterative row-action method for interval convex programming, Journal of Optimization Theory and Applications 34 (1981) 321-353.
13. Y. Censor, S. Reich: Iterations of paracontractions and firmly nonexpansive operators with applications to feasibility and optimization, Optimization 37 (1996) 323-339.
14. Y. Censor, S. Reich: The Dykstra algorithm with Bregman projections, Communications in Applied Analysis 2 (1998) 407-419.
15. Y. Censor, S. A. Zenios: Proximal minimization algorithm with D-functions, Journal of Optimization Theory and Applications 73 (1992) 451-464.
16. Y. Censor, S. A. Zenios: Parallel Optimization: Theory, Algorithms and Applications, Oxford University Press, New York, 1997.
17. P. L. Combettes: Signal recovery by best feasible approximation, IEEE Transactions on Image Processing IP-2 (1993) 269-271.
18. P. L. Combettes: The foundations of set theoretic estimation, Proceedings of the IEEE 81 (1993) 182-208.
19. P. L. Combettes: The convex feasibility problem in image recovery, Advances in Imaging and Electron Physics 95 (1996) 155-270.
20. G. Crombez: Finding projections onto the intersection of convex sets in Hubert spaces, Numerical Functional Analysis and Optimization 16 (1995) 637-652.
21. I. Csiszár: Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems, The Annals of Statistics 19 (1991) 2032-2066.
22. G. B. Dantzig: Linear Programming and Extensions, Princeton University Press, Princeton, NJ, USA, 1963.
23. A. R. De Pierro, A. N. Iusem: A relaxed version of Bregman's method for convex programming, Journal of Optimization Theory and Applications 51 (1986) 421-440.
24. D. A. D'Esopo: A convex programming procedure, Naval Research Logistics Quarterly 6 (1959) 33-42.
25. F. Deutsch, H. Hundal: The rate of convergence of Dykstra's cyclic projections algorithm: The polyhedral case, Numerical Functional Analysis and Optimization 15 (1994) 537-565.
26. R. L. Dykstra: An algorithm for restricted least squares regression, Journal of the American Statistical Association 78 (1983) 837-842.
27. R. L. Dykstra: An iterative procedure for obtaining I-projections onto the intersection of convex sets, The Annals of Probability 13 (1985) 975-984.
28. J. Eckstein: Nonlinear proximal point algorithms using Bregman functions with applications to convex programming, Mathematics of Operations Research 18 (1993) 202-226.
29. R. Escalante, M. Raydan: Dykstra's algorithm for a constrained least-squares matrix problem, Numerical Linear Algebra with Applications 3 (1996) 459-471.
30. N. Gaffke, R. Mathar: A cyclic projection algorithm via duality, Metrika 36 (1989) 29-54.
31. S.-P. Han: A successive projection method, Mathematical Programming 40 (1988) 1-14.
32. H. Hundal, F. Deutsch: Two generalizations of Dykstra's cyclic projection algorithm, Mathematical Programming 77 (1997) 335-355.
33. S.-P. Han, G. Lou: A parallel algorithm for a class of convex programs, SIAM Journal on Control and Optimization 26 (1988) 345-355.
34. G. T. Herman, A Lent: A family of iterative quadratic optimization algorithms for pairs of inequalities with application in diagnostic radiology, Mathematical Programming Study 9 (1978) 15-29.
35. C. Hildreth: A quadratic programming procedure, Naval Research Logistics Quarterly 4 (1957) 79-85. Erratum, ibid., p. 361.
36. A. N. Iusem: On dual convergence and the rate of primal convergence of Bregman's convex programming method, SIAM Journal on Optimization 1 (1991) 401-423.
37. A. N. Iusem, A. R. De Pierro: On the convergence of Han's method for convex programming with quadratic objective, Mathematical Programming 52 (1991) 265-284.
38. A. N. Iusem, S. A. Zenios: Interval underrelaxed Bregman's method with an application, Optimization 35 (1995) 227-250.
39. K. C. Kiwiel: Free-steering relaxation methods for problems with strictly convex sets and linear constraints, Mathematics of Operations Research 22 (1997) 326-349.
40. K. C. Kiwiel: Proximal minimization methods with generalized Bregman functions, SIAM Journal on Control and Optimization 35 (1997) 1142-1168.
41. A. Lent, Y. Censor: Extensions of Hildreth's row-action method for quadratic programming, SIAM Journal on Control and Optimization 18 (1980) 444-454.
42. A. L. Peressini, F. E. Sullivan, J. J. Uhl jun.: The Mathematics of Nonlinear Programming, Springer-Verlag, New York etc., 1988.
43. T. Robertson, F. T. Wright, R. L. Dykstra: Order Restricted Statistical Inference, John Wiley & Sons, Chichester, UK, 1988.
44. R. T. Rockafellar: Convex Analysis, Princeton University Press, Princeton, NJ, USA, 1970.
45. M. Teboulle: Entropic proximal mappings with applications to nonlinear programming, Mathematics of Operations Research 17 (1992) 670-690.
46. P. Tseng: Dual coordinate ascent methods for non-strictly convex minimization, Mathematical Programming 59 (1993) 231-247.