Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping
DOI10.1186/1687-1812-2014-202zbMATH Open1345.47047OpenAlexW2107803928WikidataQ59396606 ScholiaQ59396606MaRDI QIDQ286935FDOQ286935
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
Recommendations
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
- On acceleration of the Krasnosel'skiĭ-Mann fixed point algorithm based on conjugate gradient method for smooth optimization
- Accelerated Mann and CQ algorithms for finding a fixed point of a nonexpansive mapping
- scientific article; zbMATH DE number 7014239
- A Halpern-Lions-Reich-like iterative method for nonexpansive mappings
fixed pointnonexpansive mappingconjugate gradient methodsteepest descent methodHalpern algorithmsmooth convex optimization
Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15) Programming in abstract spaces (90C48)
Cites Work
- On Projection Algorithms for Solving Convex Feasibility Problems
- Title not available (Why is that?)
- Convex analysis and monotone operator theory in Hilbert spaces
- Nonlinear functional analysis. Fixed point theory and its applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fixed points of nonexpanding maps
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- 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
- 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
- Iterative algorithm for solving triple-hierarchical constrained optimization problem
- Mean Value Methods in Iteration
- Title not available (Why is that?)
- Iterative approximation of fixed points
- Fixed point optimization algorithm and its application to power control in CDMA data networks
Cited In (15)
- Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
- Accelerated hybrid viscosity and steepest-descent method for proximal split feasibility problems
- A modified Riemannian Halpern algorithm for nonexpansive mappings on Hadamard manifolds
- A residual algorithm for finding a fixed point of a nonexpansive mapping
- A Riemannian Inertial Mann Algorithm for Nonexpansive Mappings on Hadamard Manifolds
- Accelerated Mann and CQ algorithms for finding a fixed point of a nonexpansive mapping
- Inertial accelerated steepest descent algorithm for generalized split common fixed point problems
- Fixed point quasiconvex subgradient method
- 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
- The conjugate gradient method for split variational inclusion and constrained convex minimization problems
- Application of a new accelerated algorithm to regression problems
- A relaxed inertial and viscosity method for split feasibility problem and applications to image recovery
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
- An iterative method and its application to stable inversion
This page was built for publication: Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286935)
