Approximate Solutions for Three Fixed Point Problems

Alexander J. Zaslavski ()
Additional contact information
Alexander J. Zaslavski: Technion–Israel Institute of Technology

Journal of Optimization Theory and Applications, 2024, vol. 203, issue 3, No 2, 2116-2137

Abstract: Abstract In this paper, we study three fixed point problems. The first one is a fixed point problem with a set-valued mapping, while the second and third problems are convex feasibility problems with infinitely many constraints solved by the subgradient projection algorithm. We show that an approximate solution is reached after a finite number of iterations under the presence of computational errors.

Keywords: Complete metric space; Convergence analysis; Fixed point; Nonexpansive mapping; Set-valued mapping; 47H09; 47H10; 54E35 (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10957-023-02313-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:203:y:2024:i:3:d:10.1007_s10957-023-02313-1

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-023-02313-1

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().