We observe that Sturm’s error bounds readily imply that for semidefinite feasibility problems, the method of alternating projections converges at a rate of O(k-12d+1-2), where d is the singularity degree of the problem—the minimal number of facial reduction iterations needed to induce Slater’s condition. Consequently, for almost all such problems (in the sense of Lebesgue measure), alternating projections converge at a worst-case rate of O(1k)
The problem of finding a vector with the fewest nonzero elements that satisfies an un-derdetermined ...
International audienceMany iterative methods for solving optimization or feasibility problems have b...
International audienceWe study the convergence properties of an alternating proximal minimization al...
International audienceThe method of alternating projections is a classical tool to solve feasibility...
AbstractIn this paper, we consider an alternating direction algorithm for the solution of semidefini...
Abstract. We consider projection algorithms for solving (nonconvex) feasibility problems in Euclidea...
AbstractUsing the results of Smith, Solmon, and Wagner [K. Smith, D. Solomon, S. Wagner, Practical a...
Dedicated to the memory of Jean Jacques Moreau We study the usage of regularity properties of collec...
The method of alternating projections involves projecting an element of a Hilbert space cyclically o...
We establish sufficient conditions for finite convergence of the alternating projections method for ...
Tenfold improvements in computation speed can be brought to the alternating direction method of mult...
We prove that if two smooth manifolds intersect transversally, then the method of alternating projec...
AbstractThe purpose of the paper is threefold:(1) To develop a useful error bound for the method of ...
Generalized alternating projections is an algorithm that alternates relaxed projections onto a finit...
Dedicated to Boris Mordukhovich on the occasion of his 65th Birthday TheMethod of Alternating Projec...
The problem of finding a vector with the fewest nonzero elements that satisfies an un-derdetermined ...
International audienceMany iterative methods for solving optimization or feasibility problems have b...
International audienceWe study the convergence properties of an alternating proximal minimization al...
International audienceThe method of alternating projections is a classical tool to solve feasibility...
AbstractIn this paper, we consider an alternating direction algorithm for the solution of semidefini...
Abstract. We consider projection algorithms for solving (nonconvex) feasibility problems in Euclidea...
AbstractUsing the results of Smith, Solmon, and Wagner [K. Smith, D. Solomon, S. Wagner, Practical a...
Dedicated to the memory of Jean Jacques Moreau We study the usage of regularity properties of collec...
The method of alternating projections involves projecting an element of a Hilbert space cyclically o...
We establish sufficient conditions for finite convergence of the alternating projections method for ...
Tenfold improvements in computation speed can be brought to the alternating direction method of mult...
We prove that if two smooth manifolds intersect transversally, then the method of alternating projec...
AbstractThe purpose of the paper is threefold:(1) To develop a useful error bound for the method of ...
Generalized alternating projections is an algorithm that alternates relaxed projections onto a finit...
Dedicated to Boris Mordukhovich on the occasion of his 65th Birthday TheMethod of Alternating Projec...
The problem of finding a vector with the fewest nonzero elements that satisfies an un-derdetermined ...
International audienceMany iterative methods for solving optimization or feasibility problems have b...
International audienceWe study the convergence properties of an alternating proximal minimization al...