The method of alternating projections (MAP) is a common method for solving feasibility prob-lems. While employed traditionally to subspaces or to convex sets, little was known about the behavior of the MAP in the nonconvex case until 2009, when Lewis, Luke, and Malick de-rived local linear convergence results provided that a condition involving normal cones holds and at least one of the sets is superregular (a property less restrictive than convexity). How-ever, their results failed to capture very simple classical convex instances such as two lines in a three-dimensional space. In this paper, we extend and develop the Lewis-Luke-Malick framework so that not only any two linear subspaces but also any two closed convex sets whose relative in...
Abstract. We consider projection algorithms for solving (nonconvex) feasibility problems in Euclidea...
We consider the method of alternating projections for finding a point in the intersection of two pos...
Canonical analysis of two convex polyhedral cones consists in looking for two vectors (one in each c...
The method of alternating projections (MAP) is a common method for solving feasibility prob-lems. Wh...
In this paper, we introduce and develop the theory of restricted normal cones which gener-alize the ...
The problem of finding a vector with the fewest nonzero elements that satisfies an underdeter-mined ...
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...
AbstractDuality relationships in finding a best approximation from a nonconvex cone in a normed line...
Abstract The idea of a finite collection of closed sets having “linearly regular inter-section ” at ...
In optimization theory the tangent cone and the contingent cone are used to classify the regularity ...
Abstract The idea of a finite collection of closed sets having “linearly regular inter-section ” at ...
AbstractThis paper establishes an exact formula for the Fréchet coderivative and some estimates for ...
AbstractProgramming problems may be classified, on the basis of the objective function and types of ...
The article provides formulae for calculating the limiting normal cone introduced by Mordukhovich to...
Abstract. We consider projection algorithms for solving (nonconvex) feasibility problems in Euclidea...
We consider the method of alternating projections for finding a point in the intersection of two pos...
Canonical analysis of two convex polyhedral cones consists in looking for two vectors (one in each c...
The method of alternating projections (MAP) is a common method for solving feasibility prob-lems. Wh...
In this paper, we introduce and develop the theory of restricted normal cones which gener-alize the ...
The problem of finding a vector with the fewest nonzero elements that satisfies an underdeter-mined ...
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...
AbstractDuality relationships in finding a best approximation from a nonconvex cone in a normed line...
Abstract The idea of a finite collection of closed sets having “linearly regular inter-section ” at ...
In optimization theory the tangent cone and the contingent cone are used to classify the regularity ...
Abstract The idea of a finite collection of closed sets having “linearly regular inter-section ” at ...
AbstractThis paper establishes an exact formula for the Fréchet coderivative and some estimates for ...
AbstractProgramming problems may be classified, on the basis of the objective function and types of ...
The article provides formulae for calculating the limiting normal cone introduced by Mordukhovich to...
Abstract. We consider projection algorithms for solving (nonconvex) feasibility problems in Euclidea...
We consider the method of alternating projections for finding a point in the intersection of two pos...
Canonical analysis of two convex polyhedral cones consists in looking for two vectors (one in each c...