Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping
From MaRDI portal
(Redirected from Publication:286935)
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
Cites work
- scientific article; zbMATH DE number 3853749 (Why is no real title available?)
- scientific article; zbMATH DE number 47597 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3108780 (Why is no real title available?)
- A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
- Approximation of fixed points of nonexpansive mappings
- Convex analysis and monotone operator theory in Hilbert spaces
- Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
- Fixed point optimization algorithm and its application to power control in CDMA data networks
- Fixed points of nonexpanding maps
- Iterative algorithm for solving triple-hierarchical constrained optimization problem
- Iterative algorithm for triple-hierarchical constrained nonconvex optimization problem and its application to network bandwidth allocation
- Iterative approximation of fixed points
- Mean Value Methods in Iteration
- Nonlinear functional analysis. Fixed point theory and its applications
- On Projection Algorithms for Solving Convex Feasibility Problems
- Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups.
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
Cited in
(18)- Convergence analysis of the Halpern iteration with adaptive anchoring parameters
- Inertial accelerated steepest descent algorithm for generalized split common fixed point problems
- A Riemannian Inertial Mann Algorithm for Nonexpansive Mappings on Hadamard Manifolds
- General semi-implicit approximations with errors for common fixed points of nonexpansive-type operators and applications to Stampacchia variational inequality
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
- Application of a new accelerated algorithm to regression problems
- Accelerated Mann and CQ algorithms for finding a fixed point of a nonexpansive mapping
- From Halpern's fixed-point iterations to Nesterov's accelerated interpretations for root-finding problems
- Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
- A residual algorithm for finding a fixed point of a nonexpansive mapping
- On acceleration of the Krasnosel'skiĭ-Mann fixed point algorithm based on conjugate gradient method for smooth optimization
- Fixed point quasiconvex subgradient method
- Accelerated hybrid viscosity and steepest-descent method for proximal split feasibility problems
- A relaxed inertial and viscosity method for split feasibility problem and applications to image recovery
- An iterative method and its application to stable inversion
- A modified Riemannian Halpern algorithm for nonexpansive mappings on Hadamard manifolds
- An inertial S-iteration process
- The conjugate gradient method for split variational inclusion and constrained convex minimization problems
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)
