Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings

DOI10.1137/S1052623495279569zbMath0905.47044OpenAlexW2026573098MaRDI QIDQ4376148

Krzysztof C. Kiwiel, Bożena Łopuch

Publication date: 10 February 1998

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623495279569

zbMATH Keywords

relaxation methodsconvex feasibility problemsconvergence of projection methodsfirmly nonexpansive mappingsaccelerated methodssuccessive projectionssurrogate inequalities

Mathematics Subject Classification ID

Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25) Fixed-point theorems (47H10) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Numerical solutions to equations with nonlinear operators (65J15)

Related Items

Proximal Splitting Methods in Signal Processing ⋮ Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems ⋮ Coincidence points by generalized Mann iterates with applications in Hilbert spaces ⋮ Linear and strong convergence of algorithms involving averaged nonexpansive operators ⋮ Warped proximal iterations for monotone inclusions ⋮ Two-step projection methods for a system of variational inequality problems in Banach spaces ⋮ On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints ⋮ Variant gradient projection methods for the minimization problems ⋮ Linear convergence rates for extrapolated fixed point algorithms ⋮ Convergence of weighted averages of relaxed projections ⋮ Nonlinear Forward-Backward Splitting with Projection Correction ⋮ Family constraining of iterative algorithms ⋮ Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem ⋮ Reflection-projection method for convex feasibility problems with an obtuse cone ⋮ Solving monotone inclusions via compositions of nonexpansive averaged operators ⋮ Extrapolation algorithm for affine-convex feasibility problems ⋮ Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators ⋮ A Hierarchical Presentation of Operators with Fixed Points on Hilbert Spaces ⋮ Metric subregularity and the proximal point method ⋮ Fenchel duality, Fitzpatrick functions and the extension of firmly nonexpansive mappings ⋮ Generalized Mann iterates for constructing fixed points in Hilbert spaces