On the complexity of finding a Caristi's fixed point

DOI10.1016/j.ipl.2021.106119OpenAlexW3139902186MaRDI QIDQ2032159

Takashi Ishizuka

Publication date: 16 June 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2021.106119

zbMATH Keywords

computational complexitytheory of computationPLSCaristi's fixed point theoremBrøndsted's fixed point theorem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On total functions, existence theorems and computational complexity
• Optimal bounds on finding fixed points of contraction mappings
• On the complexity of 2D discrete fixed point problem
• How easy is local search?
• On the complexity of the parity argument and other inefficient proofs of existence
• On a lemma of Bishop and Phelps
• Fixed Point Theorems for Mappings Satisfying Inwardness Conditions
• A converse to Banach's fixed point theorem and its CLS-completeness

This page was built for publication: On the complexity of finding a Caristi's fixed point