International audienceWe prove that if two smooth manifolds intersect transversally, then the method of alternating projections converges locally at a linear rate. We bound the speed of convergence in terms of the angle between the manifolds, which in turn we relate to the modulus of metric regularity for the intersection problem, a natural measure of conditioning. We discuss a variety of problem classes where the projections are computationally tractable, and we illustrate the method numerically on a problem of finding a low-rank solution of a matrix equation
AbstractIn this paper, we develop and analyze schemes for accelerating the convergence of the altern...
AbstractThe cyclic projections algorithm is an important method for determining a point in the inter...
AbstractUsing the results of Smith, Solmon, and Wagner [K. Smith, D. Solomon, S. Wagner, Practical a...
We prove that if two smooth manifolds intersect transversally, then the method of alternating projec...
International audienceThe idea of a finite collection of closed sets having "linearly regular interse...
Abstract The idea of a finite collection of closed sets having “linearly regular inter-section ” at ...
International audienceThe method of alternating projections is a classical tool to solve feasibility...
Abstract The idea of a finite collection of closed sets having “linearly regular inter-section ” at ...
We consider the popular and classical method of alternating projections for finding a point in the i...
We consider the method of alternating projections for finding a point in the intersection of two pos...
Generalized alternating projections is an algorithm that alternates relaxed projections onto a finit...
Abstract. We consider projection algorithms for solving (nonconvex) feasibility problems in Euclidea...
International audienceWe study the convergence properties of an alternating proximal minimization al...
We establish sufficient conditions for finite convergence of the alternating projections method for ...
International audienceThe Douglas–Rachford and alternating direction method of multipliers are two p...
AbstractIn this paper, we develop and analyze schemes for accelerating the convergence of the altern...
AbstractThe cyclic projections algorithm is an important method for determining a point in the inter...
AbstractUsing the results of Smith, Solmon, and Wagner [K. Smith, D. Solomon, S. Wagner, Practical a...
We prove that if two smooth manifolds intersect transversally, then the method of alternating projec...
International audienceThe idea of a finite collection of closed sets having "linearly regular interse...
Abstract The idea of a finite collection of closed sets having “linearly regular inter-section ” at ...
International audienceThe method of alternating projections is a classical tool to solve feasibility...
Abstract The idea of a finite collection of closed sets having “linearly regular inter-section ” at ...
We consider the popular and classical method of alternating projections for finding a point in the i...
We consider the method of alternating projections for finding a point in the intersection of two pos...
Generalized alternating projections is an algorithm that alternates relaxed projections onto a finit...
Abstract. We consider projection algorithms for solving (nonconvex) feasibility problems in Euclidea...
International audienceWe study the convergence properties of an alternating proximal minimization al...
We establish sufficient conditions for finite convergence of the alternating projections method for ...
International audienceThe Douglas–Rachford and alternating direction method of multipliers are two p...
AbstractIn this paper, we develop and analyze schemes for accelerating the convergence of the altern...
AbstractThe cyclic projections algorithm is an important method for determining a point in the inter...
AbstractUsing the results of Smith, Solmon, and Wagner [K. Smith, D. Solomon, S. Wagner, Practical a...