Common fixed points of an infinite family of nonexpansive mappings in uniformly convex metric spaces

DOI10.1016/J.MCM.2012.01.008MaRDI QIDQ2256391zbMATH OpenOpenAlexFDO

Authors Withun Phuengrattana, Suthep Suantai

Publication date 19 February 2015

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.mcm.2012.01.008

zbMATH Keywords

Mann iterationconvex metric spacesinfinite family of nonexpansive mappings

Mathematics Subject Classification ID

Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Fixed-point theorems (47H10) Special maps on metric spaces (54E40) Fixed-point and coincidence theorems (topological aspects) (54H25)

Recommendations

• A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
• Proximal-proximal-gradient method
• scientific article; zbMATH DE number 7404502
• Proximal algorithms in statistics and machine learning
• A proximal stochastic gradient method with progressive variance reduction

Cited in

(17)

• String-averaging algorithms for convex feasibility with infinitely many sets
• Efficient proximal point algorithm for convex composite optimization
• Proximal-proximal-gradient method
• A proximal point algorithm for sequential feature extraction applications
• On Angrisani and Clavelli synthetic approaches to problems of fixed points in convex metric space
• An inexact proximal path-following algorithm for constrained convex minimization
• Common fixed points for some generalized multivalued nonexpansive mappings in uniformly convex metric spaces
• A Fixed Point Theorem for a Pair of Generalized Nonexpansive Mappings in Uniformly Convex Metric Spaces
• MGProx: a nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
• On perturbed proximal gradient algorithms
• Error bounds, quadratic growth, and linear convergence of proximal methods
• A modified Halpern iteration in CAT(0) spaces
• ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?
• Convergence of proximal gradient algorithm in the presence of adjoint mismatch
• Sharper Bounds for Proximal Gradient Algorithms with Errors
• Proximal distance algorithms: theory and practice
• A single-phase, proximal path-following framework

This page was built for publication: Common fixed points of an infinite family of nonexpansive mappings in uniformly convex metric spaces

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