Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping

DOI10.1186/1687-1812-2014-202zbMath1345.47047OpenAlexW2107803928WikidataQ59396606 ScholiaQ59396606MaRDI QIDQ286935

Kaito Sakurai, Hideaki Iiduka

Publication date: 26 May 2016

Published in: Fixed Point Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/1687-1812-2014-202

zbMATH Keywords

fixed pointnonexpansive mappingconjugate gradient methodsteepest descent methodHalpern algorithmsmooth convex optimization

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Programming in abstract spaces (90C48) Numerical solutions to equations with nonlinear operators (65J15)

Related Items (14)

A residual algorithm for finding a fixed point of a nonexpansive mapping ⋮ Accelerated Mann and CQ algorithms for finding a fixed point of a nonexpansive mapping ⋮ A modified Riemannian Halpern algorithm for nonexpansive mappings on Hadamard manifolds ⋮ An inertial S-iteration process ⋮ General semi-implicit approximations with errors for common fixed points of nonexpansive-type operators and applications to Stampacchia variational inequality ⋮ A relaxed inertial and viscosity method for split feasibility problem and applications to image recovery ⋮ Inertial accelerated steepest descent algorithm for generalized split common fixed point problems ⋮ A Riemannian Inertial Mann Algorithm for Nonexpansive Mappings on Hadamard Manifolds ⋮ The conjugate gradient method for split variational inclusion and constrained convex minimization problems ⋮ Accelerated hybrid viscosity and steepest-descent method for proximal split feasibility problems ⋮ Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings ⋮ Fixed point quasiconvex subgradient method ⋮ An iterative method and its application to stable inversion ⋮ Application of a new accelerated algorithm to regression problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fixed point optimization algorithm and its application to power control in CDMA data networks
• Iterative algorithm for solving triple-hierarchical constrained optimization problem
• Iterative approximation of fixed points
• Approximation of fixed points of nonexpansive mappings
• Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups.
• A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
• On Projection Algorithms for Solving Convex Feasibility Problems
• Iterative Algorithm for Triple-Hierarchical Constrained Nonconvex Optimization Problem and Its Application to Network Bandwidth Allocation
• Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
• Fixed points of nonexpanding maps
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• Mean Value Methods in Iteration
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping