Accelerated Mann and CQ algorithms for finding a fixed point of a nonexpansive mapping

DOI10.1186/s13663-015-0374-6zbMath1346.47040OpenAlexW1522169333WikidataQ59434730 ScholiaQ59434730MaRDI QIDQ287941

Qiao-Li Dong, Han-bo Yuan

Publication date: 23 May 2016

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

Full work available at URL: https://doi.org/10.1186/s13663-015-0374-6

zbMATH Keywords

nonexpansive mappingconjugate gradient methodPicard algorithmconvex minimization problemsteepest descent methodCQ algorithmMann algorithm

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Numerical solutions to equations with nonlinear operators (65J15)

Related Items (14)

An inertial Mann algorithm for nonexpansive mappings ⋮ A residual algorithm for finding a fixed point of a nonexpansive mapping ⋮ Accelerated modified inertial Mann and viscosity algorithms to find a fixed point of \(\alpha\)-inverse strongly monotone operators ⋮ A modified Riemannian Halpern algorithm for nonexpansive mappings on Hadamard manifolds ⋮ Bounded perturbation resilience of the viscosity algorithm ⋮ New acceleration factors of the Krasnosel'skiĭ-Mann iteration ⋮ Inertial accelerated steepest descent algorithm for generalized split common fixed point problems ⋮ MiKM: multi-step inertial Krasnosel'skiǐ-Mann algorithm and its applications ⋮ A Riemannian Inertial Mann Algorithm for Nonexpansive Mappings on Hadamard Manifolds ⋮ Inertial algorithm for solving split inclusion problem in Banach spaces ⋮ Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings ⋮ A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems ⋮ A unified algorithm for solving split generalized mixed equilibrium problem, and for finding fixed point of nonspreading mapping in Hilbert spaces ⋮ Convergence Theorems and Convergence Rates for the General Inertial Krasnosel’skiǐ–Mann Algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping
• Fixed point optimization algorithm and its application to power control in CDMA data networks
• Iterative algorithm for solving triple-hierarchical constrained optimization problem
• An example concerning fixed points
• Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process
• Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups.
• Strong convergence of the CQ method for fixed point iteration processes
• Weak and strong convergence criteria of Noor iterations for asymptotically nonexpansive mappings
• 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
• A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
• Mean Value Methods in Iteration
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: Accelerated Mann and CQ algorithms for finding a fixed point of a nonexpansive mapping