Dykstras algorithm with bregman projections: A convergence proof

References

• Alber , Y and Butnariu , D . 1997 . Convergence of Bregman-pr ejection methods for solving consistent convex feasibility problems in reflexive Banach spaces . Journal of Optimization Theory and Applications , 92 ( 1 ) : 33 – 61 .
   Web of Science ®Google Scholar
• Bauschke H. H. Projection Algorithms and Monotone Operators Ph. D. Thesis, Simon Fraser University, Department of Mathematics Burnaby, British Columbia V5A 1S6, Canada August 1996 Available at http://www.cecm.sfu.ca/preprints/ 1996pp.html
   Google Scholar
• Bauschke , H.H and Borwein , J.M . 1994 . Dykstra’s alternating projection algorithm for two sets . Journal of Approximation Theory , 79 ( 3 ) December : 418 – 443 .
   Web of Science ®Google Scholar
• Bauschke , H.H and Borwein , J.M . 1996 . On projection algorithms for solving convex feasibility problems . SIAM Review , 38 ( 3 ) September : 367 – 426 .
   Web of Science ®Google Scholar
• Bauschke , H.H and Borwein , J.M . 1997 . Legendre functions and the method of random Rregman projections . Journal of Convex Analysis , 4 ( 1 ) September : 27 – 67 .
   Google Scholar
• Bauschke , H.H , Borwein , J.M and Lewis , A.B . 1995 . The method oi cyciic projections for closed convex sets in Hilbert space . Proceedings on the Special Session on Optimization and Nonlinear Analysis . May 1995 , Jerusalem. Edited by: Censor , Y and Reich , S . Optimization and Nonlinear Analysis volume 204 of Contemporary Mathematics, 1-38. American Mathematical Society. 1997
   Google Scholar
• Boyle , J.P and Dykstra , R.L . A method for finding projections onto the intersection of convex sets in Hilbert spaces . Advances in Order Restricted Statistical Inference, Proceedings . Edited by: Dykstra , R.L , Robertson , T and Wright , F.T . Vol. 37 , pp. 28 – 47 . Iowa City : Springer-Verlag . Lecture Notes in Statistics
   Google Scholar
• Bregman , L.M . 1967 . The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming . U.S.S.R. Computational Mathematics and Mathematical Physics , 7 ( 3 ) : 200 – 217 .
   Google Scholar
• Bregman , L.M , Censor , Y and Reich , S . 1998 . Dykstra’s algorithm as the nonlinear extension of Bregman’s optimization method . Journal of Convex Analysis , 7 ( 3 ) To appear
   Google Scholar
• Burachik , R.S . 1995 . “ Generalized Proximal Point Methods of the Variational Inequality Problem ” . In Ph. D. Thesis Rio de Janeiro
   Google Scholar
• Butnariu , D , Censor , Y and Reich , S . 1997 . Iterative averaging of entropic projections for solving stochastic convex feasibility problems . Computational Optimization and Applications , 8 : 21 – 39 .
   Web of Science ®Google Scholar
• Butnariu , D and Lusem , A.N . Local moduli of convexity and their application to finding almost common points of measurable families of operators . Proceedings on the Special Session on Optimization and Nonlinear Analysis . 1995 . Edited by: Censor , Y and Reich , S . May . pp. 61 – 91 . Jerusalem : American Mathematical Society . Recent Developments in Optimization Theory and Nonlinear Analysis, volume 204 of Contemporary Mathematics
   Google Scholar
• Butnariu , D and Lusem , A.N . 1997 . On a proximal point method for convex optimization in Banach spaces . Numerical Functional Analysis and Optimization , 18 ( 7-8 ) May : 723 – 744 .
   Web of Science ®Google Scholar
• Butnariu , D , Lusem , A.N and Burachik , R.S . 1996 . Iterative methods of solving stochastic convex feasibility problems and applications . Computational Optimization and Applications , 18 ( 7-8 ) May To appear
   Google Scholar
• Byrne C. Censor Y. Proximity function minimization and the convex feasibility problem for jointly convex Bregman distances Preprint 1997
   Google Scholar
• Censor , Y and Elfving , T . 1994 . A multiprojection algorithm using Bregman projections in a product space . Numerical Algorithms , 8 ( 7-8 ) May : 221 – 239 .
   Google Scholar
• Censor , Y and Lent , A . 1981 . An iterative row-action method for interval convex programming . Journal of Optimization Theory and Applications , 34 ( 3 ) July : 321 – 353 .
   Web of Science ®Google Scholar
• Censor , Y and Reich , S . 1996 . Iterations of paracontractions and firmly non-expansive operators with applications to feasibility and optimization . Optimization , 37 ( 4 ) July : 323 – 339 .
   Google Scholar
• Censor , Y and Reich , S . 1998 . The Dykstra algorithm with Bregman projections . Communications in Applied Analysis , 2 ( 3 ) July : 407 – 419 .
   Google Scholar
• Censor , Y and Zenios , S.A . 1997 . Parallel optimization. Numerical Mathematics and Scientific Computation , New York : Oxford University Press .
   Google Scholar
• Chen , G and Teboulle , M . 1993 . Convergence analysis of a proximal-like minimization algorithm using Bregman functions . SIAM Journal on Optimization , 3 ( 3 ) August : 538 – 543 .
   Web of Science ®Google Scholar
• Combettes , P.L . 1996 . “ The Convex Feasibility Problem in Image Recovery ” . In Advances in Imaging and Electron Physics , Vol. 95 , 155 – 270 . Academic Press .
   Google Scholar
• De Pierro , A.R and Luscm , A.N . 1986 . A relaxed version of Bregman’s method for convex programming . Journal of Optimization Theory and Applications , 51 ( 3 ) December : 421 – 140 .
   Web of Science ®Google Scholar
• Deutsch , F . 1992 . “ The method of alternating orthogonal projections ” . In Approximation Theory, Spline Functions and Applications , Edited by: Singh , S.P . 105 – 121 . Kluwer Academic Publ .
   Google Scholar
• Deutsch , F . 1995 . “ Dykstra’s cyclic projections algorithm: the rate nf convergence ” . In Approximation Theory, Wavelets and Applications , Edited by: Singh , S.P . 87 – 94 . Kluwer Academic Publishers .
   Google Scholar
• Deutsch , F and Hundal , H . 1994 . The rate of convergence of Dykstra’s cyclic projections algorithm: the polyhedral case . Numerical Functional Analysis and Optimization , 15 ( 5-6 ) : 537 – 565 .
   Web of Science ®Google Scholar
• Dykstra , R.L . 1983 . An algorithm for restricted least squares regression . Journal of the American Statistical Association , 78 ( 384 ) December : 837 – 842 .
   Web of Science ®Google Scholar
• Eckstein , J . 1993 . Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming . Mathematics of Operations Research , 18 ( 1 ) February : 202 – 226 .
   Web of Science ®Google Scholar
• Eckstein , J . 1998 . Approximate iterations in Bregman-function-based proximal algorithms . Mathematical Programming , 83 ( 1 ) February : 113 – 123 .
   Web of Science ®Google Scholar
• Escalante , R and Raydan , M . 1996 . Dykstra’s algorithm for a constrained least-squares matrix Problem . Numerical Linear Algebra with Applications , 3 ( 6 ) February : 459 – 471 .
   Web of Science ®Google Scholar
• Gaflke , N and Mathar , R . 1989 . A cyclic projection algorithm via duality . Metrika , 36 ( 6 ) February : 29 – 54 .
   Google Scholar
• Glunt , W , Hayden , T.L , Hong , S and Wells , J . 1990 . An alternating projection algorithm for computing the nearest Euclidean distance matrix . SIAM Journal on Matrix Analysis and Applications , 11 ( 4 ) February : 589 – 600 .
   Web of Science ®Google Scholar
• Glunt , W.K . 1995 . An alternating projections method for certain linear problems in a Hilbert space . IMA Journal on Numerical Analysis , 15 ( 2 ) February : 291 – 305 .
   Web of Science ®Google Scholar
• Han , S.P . 1988 . A successive projection method . Mathematical Programming , 40 ( 2 ) February : 1 – 14 .
   Web of Science ®Google Scholar
• Hildreth , C . 1957 . A quadratic programming procedure . Naval Research Logistics Quarterly , 4 ( 2 ) February : 79 – 85 .
   Google Scholar
• Hiriart-Urruty , J.B and Lemaréchal , C . 1993 . “ Convex Analysis and Minimization Algorithms I ” . In Grundlehren der mathematischen Wissenschaften , Vol. 305 , Springer-Verlag .
   Google Scholar
• Hundal , H and Deutsch , F . 1997 . Two generalizations of Dykstra’s cyclic projection algorithm . Mathematical Programming , 77 ( 3 ) : 335 – 355 .
   Web of Science ®Google Scholar
• Iusem A. N. Proximal point methods in optimization Unpublished manuscript May 1994
   Google Scholar
• Iusem , A.N and De Pierro , A.R . 1991 . On the convergence of Han’s method for convex programming with quadratic objective . Mathematical Programming , 52 ( 3 ) : 265 – 284 .
   Web of Science ®Google Scholar
• Kiwiel , K.C . 1995 . Block-iterative surrogate projection methods for convex feasibility problems . Linear Algebra and its Applications , 215 ( 3 ) : 225 – 260 .
   Web of Science ®Google Scholar
• Kiwiel , K.C . 1997 . Free-steering relaxation methods for problems with strictly convex costs and linear constraints . Mathematics of Operations Research , 22 ( 2 ) : 326 – 349 .
   Web of Science ®Google Scholar
• Kiwiel , K.C . 1997 . Proximal minimization methods with generalized Bregman functions . SIAM Journal on Control and Optimization , 35 ( 4 ) : 1142 – 1168 .
   Web of Science ®Google Scholar
• Kiwiel , K.C . 1998 . Generalized Bregman projections in convex feasibility problems . Journal of Optimization Theory and Applications , 96 ( 1 ) : 139 – 157 .
   Web of Science ®Google Scholar
• Lang , S . 1993 . Real and Functional Analysis , Vol. 142 , New York : Springer-Verlag . Graduate Texts in Mathematics
   Google Scholar
• Peressini , A.L , Suiiivam , F.E and Uhl , J.J Jr . 1988 . “ The Mathematics of Nonlinear Programming ” . In Undergraduate texts in mathematics , New York : Springer-Verlag .
   Google Scholar
• Rockafeiiar , R.T . 1970 . Convex Analysis , Princeton, NJ : Princeton University Press .
   Google Scholar
• Stromberg , K.R . 1981 . An Introduction to Classical Real Analysis , Belmont, California : Wadsworth International Group .
   Google Scholar
• Teboulie , M . 1992 . Entropic proximal mappings with applications to nonlinear programming . Mathematics of Operations Research , 17 ( 3 ) : 670 – 690 .
   Web of Science ®Google Scholar
• Tseng , P . 1993 . Dual coordinate ascent methods for non-strictly convex minimization . Mathematical Programming , 59 ( 3 ) : 231 – 247 .
   Web of Science ®Google Scholar