The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
From MaRDI portal
Publication:999284
DOI10.1016/j.jat.2008.04.001zbMath1171.90008OpenAlexW2002110362MaRDI QIDQ999284
Publication date: 3 February 2009
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jat.2008.04.001
POCSRate of convergenceAngle between subspacesAlternating projectionsAngle between convex setsConvex feasibility problemCyclic projectionsNorm of nonlinear operatorsOrthogonal projectionsProjections onto convex setsRegularity properties of convex sets: regular, linearly regular, boundedly regular, boundedly linearly regular, normal, weakly normal, uniformly normalThe strong conical hull intersection property (strong CHIP)
Related Items
Dual averaging with adaptive random projection for solving evolving distributed optimization problems, Single-projection procedure for linear optimization, The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets, The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators, Restricted normal cones and the method of alternating projections: applications, The optimal error bound for the method of simultaneous projections, Linear and strong convergence of algorithms involving averaged nonexpansive operators, A new algorithm for the minimax location problem with the closest distance, Scenario decomposable subgradient projection method for two-stage stochastic programming with convex risk measures, Aggregation in intersection region for distributed heterogeneous mobile sensor networks, Random algorithms for convex minimization problems, The method of alternating relaxed projections for two nonconvex sets, Convergence properties of dynamic string-averaging projection methods in the presence of perturbations, Characterizing arbitrarily slow convergence in the method of alternating projections, Functions with prescribed best linear approximations, Stochastic First-Order Methods with Random Constraint Projection, On angles between convex sets in Hilbert spaces, Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities, Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm, Stochastic heavy-ball method for constrained stochastic optimization problems
Cites Work
- Local linear convergence for alternating and averaged nonconvex projections
- The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
- The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators
- Error bounds for the method of alternating projections
- On the convergence of von Neumann's alternating projection algorithm for two sets
- The rate of convergence for the method of alternating projections. II
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- An alternating projection that does not converge in norm
- Arbitrarily Slow Convergence of Sequences of Linear Operators: A Survey
- Convex Sets and Nearest Points
- Characterizing arbitrarily slow convergence in the method of alternating projections
- Practical and mathematical aspects of the problem of reconstructing objects from radiographs
- Decomposition through formalization in a product space
- The method of alternating projections and the method of subspace corrections in Hilbert space
- On Projection Algorithms for Solving Convex Feasibility Problems
- Strong CHIP, normality, and linear regularity of convex sets
- The Duality of Pairs of Wedges
- Functional Operators (AM-22), Volume 2
- Best approximation in inner product spaces
- Inherently parallel algorithms in feasibility and optimization and their applications. Research workshop, Haifa, Israel, March 13--16, 2000
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
