Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization

DOI10.1080/02331939608844225zbMath0883.47063MaRDI QIDQ4351184

Simeon Reich, Yair Censor

Publication date: 1 October 1997

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939608844225

zbMATH Keywords

optimization; projection operators; convex combinations; convex feasibility problem; generalized distance; repetitive control; monotone operator theory; paracontractions; firmly nonexpansive operators; measure of distance; class of Bregman functions; common asymptotic fixed point

Mathematics Subject Classification ID

90C25: Convex programming

47H05: Monotone operators and generalizations

47H09: Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc.

Related Items

Asymptotic Behavior of Relatively Nonexpansive Operators in Banach Spaces, On a proximal point method for convex optimization in banach spaces, Weak Convergence of Orbits of Nonlinear Operators in Reflexive Banach Spaces, PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS, Non-Convex feasibility problems and proximal point methods, Generic power convergence of operators in banach spaces, Convergence of Krasnoselskii-Mann iterations of nonexpansive operators, A strong convergence theorem for relatively nonexpansive mappings in a Banach space, Generalized Bregman projections in convex feasibility problems, Generic power convergence of order-preserving mappings, Convergence of sequential parafirmly nonexpansive mappings in reflexive Banach spaces, Weak and strong convergence theorems for maximal monotone operators in a Banach space, Dykstras algorithm with bregman projections: A convergence proof

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for maximum entropy image reconstruction from noisy data
• Multiplicative iterative algorithms for convex programming
• Optimization of Burg's entropy over linear constraints
• A relaxed version of Bregman's method for convex programming
• Parallel application of block-iterative methods in medical imaging and radiation therapy
• Entropic means
• An iterative row-action method for interval convex programming
• An interior points algorithm for the convex feasibility problem
• Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems
• Convergence of sequential and asynchronous nonlinear paracontractions
• Proximal minimization algorithm with \(D\)-functions
• A multiprojection algorithm using Bregman projections in a product space
• Block-iterative surrogate projection methods for convex feasibility problems
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• On the behavior of a block-iterative projection method for solving convex feasibility problems
• Decomposition through formalization in a product space
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method
• On the Convergence of the Products of Firmly Nonexpansive Mappings
• Entropic Proximal Mappings with Applications to Nonlinear Programming
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• The method of projections for finding the common point of convex sets