arXiv Analytics

Sign in

arXiv:2007.12486 [math.OC]AbstractReferencesReviewsResources

Regularity and stability for a convex feasibility problem

Enrico Miglierina, Carlo A. De Bernardi

Published 2020-07-23Version 1

Let us consider two sequences of closed convex sets $\{A_n\}$ and $\{B_n\}$ converging with respect to the Attouch-Wets convergence to $A$ and $B$, respectively. Given a starting point $a_0$, we consider the sequences of points obtained by projecting on the "perturbed" sets, i.e., the sequences $\{a_n\}$ and $\{b_n\}$ defined inductively by $b_n=P_{B_n}(a_{n-1})$ and $a_n=P_{A_n}(b_n)$. Suppose that $A\cap B$ (or a suitable substitute if $A \cap B=\emptyset$) is bounded, we prove that if the couple $(A,B)$ is (boundedly) regular then the couple $(A,B)$ is $d$-stable, i.e., for each $\{a_n\}$ and $\{b_n\}$ as above we have $\mathrm{dist}(a_n,A\cap B)\to 0$ and $\mathrm{dist}(b_n,A\cap B)\to 0$.

Comments: 16 pages. arXiv admin note: text overlap with arXiv:1907.13402
Categories: math.OC
Subjects: 47J25, 90C25, 90C48
Related articles: Most relevant | Search more
arXiv:2301.09504 [math.OC] (Published 2023-01-23)
Closed convex sets of Motzkin and generalized Minkowski types
arXiv:0804.3647 [math.OC] (Published 2008-04-23)
On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces
arXiv:1105.4049 [math.OC] (Published 2011-05-20, updated 2012-06-05)
A coordinate-free condition number for convex programming