About Regularity of Collections of Sets

115 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Linear and strong convergence of algorithms involving averaged nonexpansive operators (2014, unknown): “Then metric subregularity of A at ¯ x means that there exists δ > 0 and γ > 0 such that x ∈ B ( ¯ x ; δ ) The interested reader is referred to [18] for further information on metric subregularity; see also [1] and [24].”
Linear convergence of the Douglas–Rachford method for two closed sets (2014, background): “en restrict the consideration to the subspace L. Indeed, strong regularity (or more general, uniform regularity) can be characterized by diﬀerent quantities [18]. Thorough discussions can be found in [17, 18] and the references therein. Finally, we ﬁnish this section by recalling linear regularity p”
ABOUT STATIONARITY AND REGULARITY IN VARIATIONAL ANALYSIS (2009, unknown): “It is called Extended Extremal Principle [29,32].”
METRIC REGULARITY—A SURVEY PART 1. THEORY (2016, background): “Explicitly the theorem was partly proved in [69] (equivalence of (a) and (c)) and partly in [72] (equivalence of (a) and (b)).”
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods (2013, background): “5] (based itself on a characterization given in [36]).”