Approximate solutions of common fixed-point problems

DOI10.1007/978-3-319-33255-0MaRDI QIDQ276958zbMATH OpenOpenAlexFDO

Authors Alexander J. Zaslavski

Publication date 4 May 2016

Published in Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-33255-0

zbMATH Keywords

\(\epsilon\)-approximate solutioncommon fixed pointcomputational errorconvergence theoremconvex feasibility problemiterative algorithm

Mathematics Subject Classification ID

Fixed-point theorems (47H10) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02) Variational inequalities (49J40) Numerical methods based on nonlinear programming (49M37) Numerical optimization and variational techniques (65K10)

Recommendations

• Algorithms for solving common fixed point problems
• Asymptotic behavior of two algorithms for solving common fixed point problems
• Approximate solutions for 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

Cited in

(52)

• Algorithms for solving common fixed point problems
• Inexact orbits of nonexpansive mappings with nonsummable errors
• Quasi-convex feasibility problems: subgradient methods and convergence rates
• The method of cyclic projections for closed convex sets in a Hilbert space under the presence of computational errors
• A generalized block-iterative projection method for the common fixed point problem induced by cutters
• A fixed point result in generalized metric spaces
• Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems
• Asymptotic behavior of inexact orbits of nonexpansive mappings
• Limits of eventual families of sets with application to algorithms for the common fixed point problem
• Approximate solutions for common fixed point problems
• Fixed points and convergence results for a class of contractive mappings
• Linear convergence rates for extrapolated fixed point algorithms
• Optimization on solution sets of common fixed point problems
• CONVERGENCE OF INEXACT INFINITE PRODUCTS OF NONEXPANSIVE MAPPINGS
• TWO EXTENSIONS OF CARISTI’S THEOREM
• Fixed Point and Convergence Results for Nonexpansive Set-Valued Mappings
• Asymptotic Behavior of Iterates of a Generic Cyclical Nonexpansive Mapping
• CONVERGENCE OF INEXACT ITERATES OF CONTRACTIVE MAPPINGS IN METRIC SPACES WITH GRAPHS
• A fixed point result for mean nonexpansive mappings
• Asymptotic behavior of two algorithms for solving common fixed point problems
• Cyclical contractive mappings in hyperbolic spaces
• Approximate solutions of common fixed point problems with infinitely many operators
• Existence and convergence results for Perov contraction mappings
• CONVERGENCE OF INEXACT ITERATES OF UNIFORMLY LOCALLY NONEXPANSIVE MAPPINGS WITH SUMMABLE ERRORS
• Convergence and well-posedness properties of uniformly locally contractive mappings
• A fixed point theorem for nonself nonlinear contractions in length spaces
• Quasi-subgradient methods with Bregman distance for quasi-convex feasibility problems
• Asymptotic regularity results for a viscosity version of Halpern-type iterations for coincidence problems
• Approximate solutions for three fixed point problems
• The Krasnoselskii-Mann method for common coincidence problems
• New results related to cutters and to an extrapolated block-iterative method for finding a common fixed point of a collection of them
• Asymptotic regularity results for Halpern-type inexact iterations for coincidence problems
• Preface to the special issue dedicated to Dr. Alexander J. Zaslavski on his 65th birthday
• Asymptotic regularity results for a viscosity version of Halpern-type iterations
• Solving common fixed point problems with a countable family of operators
• Set-valued Perov strict contractions
• Two existence results regarding strict contractions on metric spaces with graphs
• Approaches to iterative algorithms for solving nonlinear equations with an application in tomographic absorption spectroscopy
• An algorithm based on a set-valued nonexpansive mapping
• Convergence results for set-valued strict contractions
• Convergence of algorithms based on unions of quasi-nonexpansive maps
• Convergence of inexact orbits of nonexpansive mappings in complete metric spaces
• Approximate fixed points for a set-valued quasi-contraction
• Convergence of the string-averaging algorithm for common fixed point problems with a countable family of operators
• Existence and approximation of coincidence points of set-valued mappings
• Stochastic quasi-subgradient methods with Bregman projection for stochastic quasi-convex feasibility problems
• Fixed point theory for two classes of nonlinear mappings
• Set-valued Perov contractive mappings
• Optimization on solution sets of common fixed point problems with a countable family of maps
• Generic existence and approximation of points of coincidence for nonlinear mappings
• The proximal point method for solving variational inequalities under the presence of computational errors
• The extragradient algorithm for variational inequalities with nonsummable computational errors

This page was built for publication: Approximate solutions of common fixed-point problems

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