We establish sufficient conditions for finite convergence of the alternating projections method for two non-intersecting and potentially nonconvex sets. Our results are based on a generalization of the concept of intrinsic transversality, which until now has been restricted to sets with nonempty intersection. In the special case of a polyhedron and closed half space, our sufficient conditions define the minimum distance between the two sets that is required for alternating projections to converge in a single iteration
We consider the popular and classical method of alternating projections for finding a point in the i...
Abstract The idea of a finite collection of closed sets having “linearly regular inter-section ” at ...
International audienceThe idea of a finite collection of closed sets having "linearly regular interse...
We consider the method of alternating projections for finding a point in the intersection of two pos...
Dedicated to Boris Mordukhovich on the occasion of his 65th Birthday TheMethod of Alternating Projec...
Abstract. We consider projection algorithms for solving (nonconvex) feasibility problems in Euclidea...
We study the usage of regularity properties of collections of sets in convergence analysis of altern...
We prove that if two smooth manifolds intersect transversally, then the method of alternating projec...
In this paper we extend the application of the alternating projection algorithm to solve the problem...
The article continues the study of the ‘regular’ arrangement of a collection of sets near a point in...
International audienceThe method of alternating projections is a classical tool to solve feasibility...
We give several unifying results, interpretations, and examples regarding the convergence of the von...
AbstractIn this paper, we develop and analyze schemes for accelerating the convergence of the altern...
Abstract The idea of a finite collection of closed sets having “linearly regular inter-section ” at ...
We observe that Sturm’s error bounds readily imply that for semidefinite feasibility problems, the m...
We consider the popular and classical method of alternating projections for finding a point in the i...
Abstract The idea of a finite collection of closed sets having “linearly regular inter-section ” at ...
International audienceThe idea of a finite collection of closed sets having "linearly regular interse...
We consider the method of alternating projections for finding a point in the intersection of two pos...
Dedicated to Boris Mordukhovich on the occasion of his 65th Birthday TheMethod of Alternating Projec...
Abstract. We consider projection algorithms for solving (nonconvex) feasibility problems in Euclidea...
We study the usage of regularity properties of collections of sets in convergence analysis of altern...
We prove that if two smooth manifolds intersect transversally, then the method of alternating projec...
In this paper we extend the application of the alternating projection algorithm to solve the problem...
The article continues the study of the ‘regular’ arrangement of a collection of sets near a point in...
International audienceThe method of alternating projections is a classical tool to solve feasibility...
We give several unifying results, interpretations, and examples regarding the convergence of the von...
AbstractIn this paper, we develop and analyze schemes for accelerating the convergence of the altern...
Abstract The idea of a finite collection of closed sets having “linearly regular inter-section ” at ...
We observe that Sturm’s error bounds readily imply that for semidefinite feasibility problems, the m...
We consider the popular and classical method of alternating projections for finding a point in the i...
Abstract The idea of a finite collection of closed sets having “linearly regular inter-section ” at ...
International audienceThe idea of a finite collection of closed sets having "linearly regular interse...