Alternating projections in CAT(0) spaces
DOI10.1016/j.jmaa.2011.06.079zbMath1232.47047MaRDI QIDQ641621
Miroslav Bačák, Ian Searston, Brailey Sims
Publication date: 24 October 2011
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2011.06.079
strong convergence; weak convergence; convex optimization; nonexpansive mapping; CAT(0) space; nearest point mapping; nonpositive curvature; alternating projections; feasibility problem
47J25: Iterative procedures involving nonlinear operators
54H25: Fixed-point and coincidence theorems (topological aspects)
54E40: Special maps on metric spaces
47N10: Applications of operator theory in optimization, convex analysis, mathematical programming, economics
Related Items
Cites Work
- A concept of convergence in geodesic spaces
- CAT\((k)\)-spaces, weak convergence and fixed points
- Gradient flows on nonpositively curved metric spaces and harmonic maps
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Equilibrium maps between metric spaces
- Projection and proximal point methods: Convergence results and counterexamples.
- Geometry of the space of phylogenetic trees
- An alternating projection that does not converge in norm
- Analogs of weak convergence in a special metric space
- The geometry and topology of reconfiguration
- Fixed points of uniformly Lipschitzian mappings
- Fixed point theorems in CAT(0) spaces and \(\mathbb R\)-trees
- Characterizing arbitrarily slow convergence in the method of alternating projections
- Nonpositive Curvature and Pareto Optimal Coordination of Robots
- Remarks on Some Fixed Point Theorems
- A new proximal point iteration that converges weakly but not in norm
- On Projection Algorithms for Solving Convex Feasibility Problems
- A Norm Convergence Result on Random Products of Relaxed Projections in Hilbert Space
- Alternating Projections on Manifolds
- Riemannian geometry and geometric analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item