Proximity Function Minimization Using Multiple Bregman Projections, with Applications to Split Feasibility and Kullback–Leibler Distance Minimization
Authors:
- 1 July 2001
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 105 (1-4) , 77-98
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Block-iterative surrogate projection methods for convex feasibility problemsLinear Algebra and its Applications, 1995
- A multiprojection algorithm using Bregman projections in a product spaceNumerical Algorithms, 1994
- Convergence analysis for a multiplicatively relaxed EM algorithmMathematical Methods in the Applied Sciences, 1991
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problemsLinear Algebra and its Applications, 1989
- Parallel application of block-iterative methods in medical imaging and radiation therapyMathematical Programming, 1988
- Convergence results for an accelerated nonlinear cimmino algorithmNumerische Mathematik, 1986
- Decomposition through formalization in a product spaceMathematical Programming, 1984
- An iterative row-action method for interval convex programmingJournal of Optimization Theory and Applications, 1981
- The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programmingUSSR Computational Mathematics and Mathematical Physics, 1967
- The method of projections for finding the common point of convex setsUSSR Computational Mathematics and Mathematical Physics, 1967