About uniform regularity of collections of sets.
From MaRDI portal
Publication:5261773
Abstract: We further investigate the uniform regularity property of collections of sets via primal and dual characterizing constants. These constants play an important role in determining convergence rates of projection algorithms for solving feasibility problems.
Recommendations
Cited in
(16)- About subtransversality of collections of sets
- Dual sufficient characterizations of transversality properties
- Quantitative characterizations of regularity properties of collections of sets
- About extensions of the extremal principle
- About intrinsic transversality of pairs of sets
- A convergent relaxation of the Douglas-Rachford algorithm
- Nonlinear transversality of collections of sets: dual space necessary characterizations
- Transversality properties: primal sufficient conditions
- Geometric and metric characterizations of transversality properties
- Extremality, stationarity and generalized separation of collections of sets
- Set regularities and feasibility problems
- The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
- Regularity of collections of sets and convergence of inexact alternating projections
- Some new characterizations of intrinsic transversality in Hilbert spaces
- About \([q]\)-regularity properties of collections of sets
- Extremality of families of sets
This page was built for publication: About uniform regularity of collections of sets.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261773)