Optimal bounds on finding fixed points of contraction mappings

DOI10.1016/j.tcs.2010.01.016zbMath1192.68852OpenAlexW2062317525MaRDI QIDQ964391

Ching-Lueh Chang, Yuh-Dauh Lyuu

Publication date: 15 April 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.01.016

zbMATH Keywords

contraction mapping principleBanach fixed-point theoremquery complexityCaristi-Kirk fixed-point theorem

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Related Items (1)

On the complexity of finding a Caristi's fixed point

Cites Work

• A contraction principle for finite global games
• The Banach fixed point theorem in fuzzy quasi-metric spaces with application to the domain of words
• Exponential lower bounds for finding Brouwer fixed points
• The complexity of Tarski's fixed point theorem
• An application of the contraction mapping principle in the theory of operators in an indefinite metric space
• Existence and uniqueness of Cournot equilibrium: A contraction mapping approach
• Systems of equilibrium problems with applications to new variants of Ekeland's variational principle, fixed point theorems and parametric optimization problems
• On algorithms for discrete and approximate brouwer fixed points
• Fixed Point Theorems for Mappings Satisfying Inwardness Conditions
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal bounds on finding fixed points of contraction mappings