A residual algorithm for finding a fixed point of a nonexpansive mapping

DOI10.1007/s11784-018-0596-4OpenAlexW2809676625MaRDI QIDQ1615317

William La Cruz

Publication date: 30 October 2018

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

Full work available at URL: https://doi.org/10.1007/s11784-018-0596-4

zbMATH Keywords

fixed pointnonexpansive mappingHalpern algorithmMann algorithmIshikawa's iterationresidual algorithm

Mathematics Subject Classification ID

Derivative-free methods and methods using generalized derivatives (90C56) Iterative procedures involving nonlinear operators (47J25) Equations involving nonlinear operators (general) (47J05) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)

Related Items

Iterative algorithms of generalized nonexpansive mappings and monotone operators with application to convex minimization problem ⋮ A general inertial projected gradient method for variational inequality problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping
• Accelerated Mann and CQ algorithms for finding a fixed point of a nonexpansive mapping
• NE/SQP: A robust algorithm for the nonlinear complementarity problem
• A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
• Approximation of fixed points of nonexpansive mappings
• Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process
• Iteration sequences for asymptotically quasi-nonexpansive mapping with an error member of uniform convex Banach space.
• Fixed-point iterations for asymptotically nonexpansive mappings in Banach spaces
• A spectral algorithm for large-scale systems of nonlinear monotone equations
• Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities
• On some Mann's type iterative algorithms
• A new hybrid algorithm for a nonexpansive mapping
• A general iterative method for nonexpansive mappings in Hilbert spaces
• R-linear convergence of the Barzilai and Borwein gradient method
• Two-Point Step Size Gradient Methods
• A mathematical programming approach for determining oligopolistic market equilibrium
• Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems
• An algorithm based on a sequence of linear complementarity problems applied to a walrasian equilibrium model: An example
• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
• Fixed Points by a New Iteration Method
• On the Barzilai and Borwein choice of steplength for the gradient method
• Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
• Fixed Point Theory for Lipschitzian-type Mappings with Applications
• Fixed points of nonexpanding maps
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• Mean Value Methods in Iteration
• Matrix Iterative Analysis
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: A residual algorithm for finding a fixed point of a nonexpansive mapping