Convergence of Bregman Projection Methods for Solving Consistent Convex Feasibility Problems in Reflexive Banach Spaces
- 1 January 1997
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 92 (1) , 33-61
- https://doi.org/10.1023/a:1022631928592
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Strong convergence of expected-projection methods in hilbert spacesNumerical Functional Analysis and Optimization, 1995
- On the Convergence of the Products of Firmly Nonexpansive MappingsSIAM Journal on Optimization, 1992
- Method of successive projections for finding a common point of sets in metric spacesJournal of Optimization Theory and Applications, 1990
- A relaxed version of Bregman's method for convex programmingJournal of Optimization Theory and Applications, 1986
- A limit theorem for projectionsLinear and Multilinear Algebra, 1983
- 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
- On the factorization of matricesCommentarii Mathematici Helvetici, 1955
- On Rings of Operators. Reduction TheoryAnnals of Mathematics, 1949