The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators
From MaRDI portal
Publication:855484
DOI10.1016/J.JAT.2006.02.006zbMATH Open1109.41017OpenAlexW1975567493MaRDI QIDQ855484FDOQ855484
Publication date: 7 December 2006
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jat.2006.02.006
Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Best approximation, Chebyshev systems (41A50)
Cites Work
- Error bounds for the method of alternating projections
- On Projection Algorithms for Solving Convex Feasibility Problems
- Theory of Reproducing Kernels
- On the convergence of von Neumann's alternating projection algorithm for two sets
- An alternating projection that does not converge in norm
- Best approximation in inner product spaces
- The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
- The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
- Étude sur les variétés et les opérateurs de Julia, avec quelques applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (14)
- Restricted normal cones and the method of alternating projections: applications
- Title not available (Why is that?)
- Local linear convergence for alternating and averaged nonconvex projections
- Title not available (Why is that?)
- Title not available (Why is that?)
- On angles between convex sets in Hilbert spaces
- Stochastic first-order methods with random constraint projection
- Random algorithms for convex minimization problems
- The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
- The method of alternating relaxed projections for two nonconvex sets
- The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
- Characterizing arbitrarily slow convergence in the method of alternating projections
- Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm
- Convergence properties of dynamic string-averaging projection methods in the presence of perturbations
Recommendations
- The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets 👍 👎
- Two generalizations of Dykstra's cyclic projections algorithm 👍 👎
- The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem 👍 👎
- On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections 👍 👎
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case 👍 👎
- Tikhonov-regularization of ill-posed linear operator equations on closed convex sets 👍 👎
- The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets 👍 👎
- Convergence of projection algorithms to approximate solutions of convex feasibility problems 👍 👎
- On projection reflection method in Hilbert spaces 👍 👎
This page was built for publication: The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855484)