An iterative algorithm on fixed points of relaxed Lipschitz operators

DOI10.1155/S1048953397000221MaRDI QIDQ1366410zbMATH OpenFDO

Authors Ram U. Verma

Publication date 10 September 1997

Published in Journal of Applied Mathematics and Stochastic Analysis (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/47871

zbMATH Keywords

approximating fixed pointsiterative algorithmrelaxed Lipschitz operator

Mathematics Subject Classification ID

Fixed-point theorems (47H10)

Review text

The author defines an iterative algorithm of the form \[ x_{n+1}= (1-a_n)x_n+ a_n[(1-t)x_n+ tTx_n] \] which is suitable for approximating fixed points of a relaxed Lipschitz operator \(T\) in a real Hilbert space.

Recommendations

• An iterative procedure for approximating fixed points of relaxed monotone operators
• Mann type algorithms for the fixed points of Lipschitzian strongly Lipschitz operators
• Iterative algorithms of contractive mappings' fixed point
• An iteration method for nonexpansive mappings in Hilbert spaces
• scientific article; zbMATH DE number 4182176

Cited in

(6)

• A characterization of the set of fixed points of some smoothed operators
• Some new convergence and stability results for Jungck generalized pseudo-contractive and Lipschitzian type operators using hybrid iterative techniques in the Hilbert space
• Mann type algorithms for the fixed points of Lipschitzian strongly Lipschitz operators
• An iterative procedure for approximating fixed points of relaxed monotone operators
• scientific article; zbMATH DE number 1553753 (Why is no real title available?)
• Lipschitzian solutions to linear iterative equations revisited

This page was built for publication: An iterative algorithm on fixed points of relaxed Lipschitz operators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1366410)