On the complexity of finding a Caristi's fixed point
type: Item
instance of: scholarly article
title: On the complexity of finding a Caristi's fixed point
author: Takashi Ishizuka
published in: Information Processing Letters
publication date: 2021-06-16T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7360079
zbMATH Keywords: computational complexity
zbMATH Keywords: theory of computation
zbMATH Keywords: PLS
zbMATH Keywords: Caristi's fixed point theorem
zbMATH Keywords: Brøndsted's fixed point theorem
MaRDI profile type: Publication
full work available at URL: j.ipl.2021.106119
OpenAlex ID: W3139902186
cites work: On total functions, existence theorems and computational complexity
cites work: Q4298260
cites work: On the complexity of the parity argument and other inefficient proofs of existence
cites work: On the complexity of 2D discrete fixed point problem
cites work: How easy is local search?
cites work: A converse to Banach's fixed point theorem and its CLS-completeness
cites work: Q5875712
cites work: Q4421936
cites work: Optimal bounds on finding fixed points of contraction mappings
cites work: Q5365081
cites work: Fixed Point Theorems for Mappings Satisfying Inwardness Conditions
cites work: On a lemma of Bishop and Phelps
DOI: 10.1016/J.IPL.2021.106119
description: scientific article; zbMATH DE number 7360079