Approximate solutions of common fixed point problems with infinitely many operators

DOI10.3934/JIMO.2023097MaRDI QIDQ6065193zbMATH OpenOpenAlexFDO

Authors Alexander J. Zaslavski

Publication date 11 December 2023

Published in Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/jimo.2023097

zbMATH Keywords

fixed pointiterationmetric spacenonexpansive mapping

Mathematics Subject Classification ID

Set-valued operators (47H04) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Fixed-point theorems (47H10)

Recommendations

• Approximate solutions for common fixed point problems
• Approximate solutions of common fixed-point problems
• Asymptotic behavior of two algorithms for solving common fixed point problems
• A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors
• Solving for (approximate) convex feasibility under finite precision

Cites work

• A general iterative method for split common fixed point problems in Hilbert spaces and applications
• A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
• A new split inverse problem and an application to least intensity feasible solutions
• A note on alternating projections in Hilbert space
• A strong convergence theorem by Halpern type iteration for a finite family of generalized demimetric mappings in a Hilbert space
• Algorithms for solving common fixed point problems
• Approximate solutions of common fixed-point problems
• Averaging strings of sequential iterations for convex feasibility problems.
• Convergence to fixed points of inexact orbits of Bregman-monotone and of nonexpansive operators in Banach spaces
• scientific article; zbMATH DE number 2148414 (Why is no real title available?)
• Iterative methods for generalized split feasibility problems in Hilbert spaces
• Linear superiorization for infeasible linear programming
• Perturbation resilience and superiorization of iterative algorithms
• Projected subgradient minimization versus superiorization
• Speedup of lexicographic optimization by superiorization and its applications to cancer radiotherapy treatment
• The split common fixed point problem and the shrinking projection method for new nonlinear mappings in two Banach spaces
• The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning
• Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods

This page was built for publication: Approximate solutions of common fixed point problems with infinitely many operators

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