Regularity and stability for a convex feasibility problem
From MaRDI portal
Abstract: Let us consider two sequences of closed convex sets and converging with respect to the Attouch-Wets convergence to and , respectively. Given a starting point , we consider the sequences of points obtained by projecting on the "perturbed" sets, i.e., the sequences and defined inductively by and . Suppose that (or a suitable substitute if ) is bounded, we prove that if the couple is (boundedly) regular then the couple is -stable, i.e., for each and as above we have and .
Recommendations
- Stability of a convex feasibility problem
- On the regularity condition in a convex feasibility problem
- Set regularities and feasibility problems
- Regularity of collections of sets and convergence of inexact alternating projections
- The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
Cites work
- A variational approach to the alternating projections method
- An alternating projection that does not converge in norm
- Banach space theory. The basis for linear and nonlinear analysis
- Convexity and well-posed problems
- scientific article; zbMATH DE number 490143 (Why is no real title available?)
- scientific article; zbMATH DE number 3229228 (Why is no real title available?)
- scientific article; zbMATH DE number 957458 (Why is no real title available?)
- Intersection properties of the unit ball
- Norm convergence of realistic projection and reflection methods
- On rings of operators. Reduction theory
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Stability of a convex feasibility problem
- Star-finite coverings of Banach spaces
- Techniques of variational analysis
- Tilings of Normed Spaces
Cited in
(2)
This page was built for publication: Regularity and stability for a convex feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2670978)