Dedicated to the memory of Jean Jacques Moreau We study the usage of regularity properties of collections of sets in con-vergence analysis of alternating projection methods for solving feasibility problems. Several equivalent characterizations of these properties are pro-vided. Two settings of inexact alternating projections are considered and the corresponding convergence estimates are established and discussed
AbstractThe cyclic projections algorithm is an important method for determining a point in the inter...
We consider the method of alternating projections for finding a point in the intersection of two pos...
We analyze Dykstra's algorithm for two arbitrary closed convex sets in a Hilbert space. Our techniqu...
We study the usage of regularity properties of collections of sets in convergence analysis of altern...
International audienceThe method of alternating projections is a classical tool to solve feasibility...
We synthesize and unify notions of regularity, both of individual sets and of collections of sets, a...
Abstract. We consider projection algorithms for solving (nonconvex) feasibility problems in Euclidea...
We further investigate the uniform regularity property of collections of sets via primal and dual ch...
We establish sufficient conditions for finite convergence of the alternating projections method for ...
Dedicated to Boris Mordukhovich on the occasion of his 65th Birthday TheMethod of Alternating Projec...
International audienceThe idea of a finite collection of closed sets having "linearly regular interse...
We observe that Sturm’s error bounds readily imply that for semidefinite feasibility problems, the m...
Abstract The idea of a finite collection of closed sets having “linearly regular inter-section ” at ...
Abstract The idea of a finite collection of closed sets having “linearly regular inter-section ” at ...
In this paper, we introduce and develop the theory of restricted normal cones which gener-alize the ...
AbstractThe cyclic projections algorithm is an important method for determining a point in the inter...
We consider the method of alternating projections for finding a point in the intersection of two pos...
We analyze Dykstra's algorithm for two arbitrary closed convex sets in a Hilbert space. Our techniqu...
We study the usage of regularity properties of collections of sets in convergence analysis of altern...
International audienceThe method of alternating projections is a classical tool to solve feasibility...
We synthesize and unify notions of regularity, both of individual sets and of collections of sets, a...
Abstract. We consider projection algorithms for solving (nonconvex) feasibility problems in Euclidea...
We further investigate the uniform regularity property of collections of sets via primal and dual ch...
We establish sufficient conditions for finite convergence of the alternating projections method for ...
Dedicated to Boris Mordukhovich on the occasion of his 65th Birthday TheMethod of Alternating Projec...
International audienceThe idea of a finite collection of closed sets having "linearly regular interse...
We observe that Sturm’s error bounds readily imply that for semidefinite feasibility problems, the m...
Abstract The idea of a finite collection of closed sets having “linearly regular inter-section ” at ...
Abstract The idea of a finite collection of closed sets having “linearly regular inter-section ” at ...
In this paper, we introduce and develop the theory of restricted normal cones which gener-alize the ...
AbstractThe cyclic projections algorithm is an important method for determining a point in the inter...
We consider the method of alternating projections for finding a point in the intersection of two pos...
We analyze Dykstra's algorithm for two arbitrary closed convex sets in a Hilbert space. Our techniqu...