Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
- 1 January 1996
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 37 (4) , 323-339
- https://doi.org/10.1080/02331939608844225
Abstract
A generalized “measure of distance” defined by . is generated from any member f of the class of Bregman functions. Although it is not. technically speaking. a distance function. it has been used in the past to define and study projection operators. In this paper we give new definitions of paracont ractions. convex combinations. and firmly nonexpansivc operators. based on Df (x,y), and study sequential and simultaneous iterative algorithms employing them for the solution of the problem of finding a common asymptotic fixed point of a family of operators. Applications to the convex feasibility problem. to optimization and to monotone operator theory are also included.Keywords
This publication has 26 references indexed in Scilit:
- Block-iterative surrogate projection methods for convex feasibility problemsLinear Algebra and its Applications, 1995
- Iterative image reconstruction algorithms based on cross-entropy minimizationIEEE Transactions on Image Processing, 1993
- Convergence of sequential and asynchronous nonlinear paracontractionsNumerische Mathematik, 1992
- Why Least Squares and Maximum Entropy? An Axiomatic Approach to Inference for Linear Inverse ProblemsThe Annals of Statistics, 1991
- Multiplicative iterative algorithms for convex programmingLinear Algebra and its Applications, 1990
- On the behavior of a block-iterative projection method for solving convex feasibility problemsInternational Journal of Computer Mathematics, 1990
- Entropic meansJournal of Mathematical Analysis and Applications, 1989
- An interior points algorithm for the convex feasibility problemAdvances in Applied Mathematics, 1983
- 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