Stability of a convex feasibility problem

DOI10.1007/S10898-019-00806-WMaRDI QIDQ2010108zbMATH OpenOpenAlexWikidataFDO

Authors Carlo Alberto De Bernardi, E. Miglierina, E. Molho

Publication date 3 December 2019

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1806.10033

zbMATH Keywords

stabilityconvex feasibility problemset-convergence

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Set-valued and variational analysis (49J53)

Abstract: The 2-sets convex feasibility problem aims at finding a point in the intersection of two closed convex sets $A$ and $B$ in a normed space $X$. More generally, we can consider the problem of finding (if possible) two points in $A$ and $B$, respectively, which minimize the distance between the sets. In the present paper, we study some stability properties for the convex feasibility problem: we consider two sequences of sets, each of them converging, with respect to a suitable notion of set convergence, respectively, to $A$ and $B$. Under appropriate assumptions on the original problem, we ensure that the solutions of the perturbed problems converge to a solution of the original problem. We consider both the finite-dimensional and the infinite-dimensional case. Moreover, we provide several examples that point out the role of our assumptions in the obtained results.

Recommendations

• Regularity and stability for a convex feasibility problem
• Stability for convex vector optimization problems
• On convex feasibility problems
• On finitely convergent iterative methods for the convex feasibility problem
• A strongly convergent parallel projection algorithm for convex feasibility problem

Cites work

• scientific article; zbMATH DE number 1821400 (Why is no real title available?)
• scientific article; zbMATH DE number 957458 (Why is no real title available?)
• An alternating projection that does not converge in norm
• Banach space theory. The basis for linear and nonlinear analysis
• Convex analysis and monotone operator theory in Hilbert spaces
• Convexity and well-posed problems
• Norm convergence of realistic projection and reflection methods
• On Projection Algorithms for Solving Convex Feasibility Problems
• Projection methods: an annotated bibliography of books and reviews
• Techniques of variational analysis

Cited in

(7)

• On the Stability of the Feasible Set in Optimization Problems
• A variational approach to the alternating projections method
• Regularity and stability for a convex feasibility problem
• scientific article; zbMATH DE number 7685245 (Why is no real title available?)
• On the stability of the feasible set in linear optimization
• On the stability of the boundary of the feasible set in linear optimization
• A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference

This page was built for publication: Stability of a convex feasibility problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010108)