The Approximation of Fixed Points of Compositions of Nonexpansive Mappings in Hilbert Space
Journal of Mathematical Analysis and ApplicationsPublished 1 August 1996
Heinz H. Bauschke
Citations345
SJR quartileQ1
SJR score0.85
SNIP1.14
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
Determining fixed points of nonexpansive mappings is a frequent problem in mathematics and physical sciences. An algorithm for finding common fixed points of nonexpansive mappings in Hilbert space, essentially due to Halpern, is analyzed. The main theorem extends Wittmann's recent work and partially generalizes a result by Lions. Algorithms of this kind have been applied to the convex feasibility problem.
Keywords
Computer ScienceMathematics
SIAM Journal on Control and OptimizationMonotone Operators and the Proximal Point Algorithm
3,620 Citations1976R. T. Rockafellar
Cambridge University Press eBooksTopics in Metric Fixed Point Theory
2,331 Citations1990Kazimierz Goebel, W. A. Kirk
SIAM ReviewOn Projection Algorithms for Solving Convex Feasibility Problems
1,711 Citations1996Heinz H. Bauschke, Jonathan M. Borwein
A very broad and flexible framework is investigated which allows a systematic discussion of questions on behaviour in general Hilbert spaces and on the quality of convergence in convex feasibility problems.
Bulletin of the American Mathematical SocietyFixed points of nonexpanding maps
1,057 Citations1967Benjamin Halpern
Proceedings of the IEEEThe foundations of set theoretic estimation
635 Citations1993Patrick L. Combettes
Israel Journal of MathematicsAn example concerning fixed points
322 Citations1975A. Genel, Joram Lindenstrauss
Set-Valued AnalysisOn the convergence of von Neumann's alternating projection algorithm for two sets
303 Citations1993Heinz H. Bauschke, Jonathan M. Borwein
IEEE Transactions on Signal ProcessingInconsistent signal feasibility problems: least-squares solutions in a product space
197 Citations1994Patrick L. Combettes
Presents parallel projection methods to find least-squares solutions to inconsistent convex set theoretic signal synthesis problems and convergence properties of the proposed methods are analyzed and signal synthesis applications are demonstrated.
Canadian Mathematical BulletinKrasnoselski-Mann Iterations in Normed Spaces
119 Citations1992Jonathan M. Borwein, Simeon Reich +1 more
The foundations of set theoretic estimation
69 Citations1991Patrick L. Combettes, M. Reha Civanlar
A single formal framework is presented to synthesize various approaches to set theory estimation, and the fundamental philosophy, goals, and analytical techniques of set theoretic estimation are discussed.