Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings

DOI10.1137/S1052623495279569MaRDI QIDQ4376148zbMATH OpenOpenAlexFDO

Authors 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) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Fixed-point theorems (47H10) Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15)

Recommendations

• scientific article; zbMATH DE number 1070394
• Block-iterative surrogate projection methods for convex feasibility problems
• Successive Averages of Firmly Nonexpansive Mappings
• scientific article; zbMATH DE number 806611
• Shrinking projection methods for firmly nonexpansive mappings

Cited in

(24)

• Warped proximal iterations for monotone inclusions
• Linear convergence rates for extrapolated fixed point algorithms
• Coincidence points by generalized Mann iterates with applications in Hilbert spaces
• Linear and strong convergence of algorithms involving averaged nonexpansive operators
• A finitely convergent circumcenter method for the convex feasibility problem
• Proximal splitting methods in signal processing
• Nonlinear forward-backward splitting with projection correction
• Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
• Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators
• On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
• Generalized Mann iterates for constructing fixed points in Hilbert spaces
• A Hierarchical Presentation of Operators with Fixed Points on Hilbert Spaces
• Reflection-projection method for convex feasibility problems with an obtuse cone
• Family constraining of iterative algorithms
• Variant gradient projection methods for the minimization problems
• Two-step projection methods for a system of variational inequality problems in Banach spaces
• Subtransversality and strong CHIP of closed sets in Asplund spaces
• Convergence of weighted averages of relaxed projections
• Metric subregularity and the proximal point method
• Successive Averages of Firmly Nonexpansive Mappings
• Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• Fenchel duality, Fitzpatrick functions and the extension of firmly nonexpansive mappings
• Extrapolation algorithm for affine-convex feasibility problems

This page was built for publication: Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376148)