Set Regularities and Feasibility Problems
arXiv:1602.04935 · doi:10.1007/s10107-016-1039-x
Abstract
We synthesize and unify notions of regularity, both of individual sets and of collections of sets, as they appear in the convergence theory of projection methods for consistent feasibility problems. Several new characterizations of regularities are presented which shed light on the relations between seemingly different ideas and point to possible necessary conditions for local linear convergence of fundamental algorithms.
References in corpus (1)
Cited by in corpus (20)
- Quantitative convergence analysis of iterated expansive, set-valued mappings
- About subtransversality of collections of sets
- Necessary conditions for linear convergence of iterated expansive, set-valued mappings with application to alternating projections
- A new projection method for finding the closest point in the intersection of convex sets
- About intrinsic transversality of pairs of sets
- Convergence Analysis of the Relaxed Douglas-Rachford Algorithm
- Extremality, Stationarity and Generalized Separation of Collections of Sets
- Transversality Properties: Primal Sufficient Conditions
- Random Function Iterations for Consistent Stochastic Feasibility
- Perturbation of error bounds
- On tangential transversality
- Extremality of families of sets
- A successive centralized circumcenter reflection method for the convex feasibility problem
- Subtransversality and Strong CHIP of Closed Sets in Asplund Spaces
- Characterizations of Super-regularity and its Variants
- Fuzzy multiplier, sum and intersection rules in non-Lipschitzian settings: decoupling approach revisited
- Necessary Conditions for Non-Intersection of Collections of Sets
- A finitely convergent circumcenter method for the Convex Feasibility Problem
- Quasioptimal alternating projections and their use in low-rank approximation of matrices and tensors
- Projection methods for high numerical aperture phase retrieval