AbstractThe purpose of the paper is threefold:(1) To develop a useful error bound for the method of alternating projections which is relatively easy to compute and remember;(2) To exhibit a counterexample to a conjecture of Kayalar and Weinert;(3) To show that (in the case of at least three subspaces) any error bound which only depends on the angles between the various subspaces involved canneverbe sharp
We observe that Sturm’s error bounds readily imply that for semidefinite feasibility problems, the m...
International audienceThe idea of a finite collection of closed sets having "linearly regular interse...
Bauschke, Borwein, and Lewis have stated a trichotomy theorem [4, Theorem 5.7.16] that characterizes...
AbstractIn this paper, we develop and analyze schemes for accelerating the convergence of the altern...
We study the well-known methods of alternating and simultaneous projections when applied to two nono...
Abstract. The powerful von Neumann-Halperin method of alternating pro-jections (MAP) is an algorithm...
Generalized alternating projections is an algorithm that alternates relaxed projections onto a finit...
Abstract. A new identity is given in this paper for estimating the norm of the product of nonexpansi...
AbstractUsing the results of Smith, Solmon, and Wagner [K. Smith, D. Solomon, S. Wagner, Practical a...
The method of alternating projections involves projecting an element of a Hilbert space cyclically o...
Abstract. Given N ≥ 2 closed subspaces M1, . . . , MN of a Hilbert space X, let Pk denote the orthog...
The averaged alternating modified reflections (AAMR) method is a projection algorithm for finding th...
AbstractThe rate of convergence for the cyclic projections algorithm onto an intersection of finitel...
AbstractWe define angles for infinite dimensional subspaces of Hilbert spaces, inspired by the work ...
International audienceWe prove that if two smooth manifolds intersect transversally, then the method...
We observe that Sturm’s error bounds readily imply that for semidefinite feasibility problems, the m...
International audienceThe idea of a finite collection of closed sets having "linearly regular interse...
Bauschke, Borwein, and Lewis have stated a trichotomy theorem [4, Theorem 5.7.16] that characterizes...
AbstractIn this paper, we develop and analyze schemes for accelerating the convergence of the altern...
We study the well-known methods of alternating and simultaneous projections when applied to two nono...
Abstract. The powerful von Neumann-Halperin method of alternating pro-jections (MAP) is an algorithm...
Generalized alternating projections is an algorithm that alternates relaxed projections onto a finit...
Abstract. A new identity is given in this paper for estimating the norm of the product of nonexpansi...
AbstractUsing the results of Smith, Solmon, and Wagner [K. Smith, D. Solomon, S. Wagner, Practical a...
The method of alternating projections involves projecting an element of a Hilbert space cyclically o...
Abstract. Given N ≥ 2 closed subspaces M1, . . . , MN of a Hilbert space X, let Pk denote the orthog...
The averaged alternating modified reflections (AAMR) method is a projection algorithm for finding th...
AbstractThe rate of convergence for the cyclic projections algorithm onto an intersection of finitel...
AbstractWe define angles for infinite dimensional subspaces of Hilbert spaces, inspired by the work ...
International audienceWe prove that if two smooth manifolds intersect transversally, then the method...
We observe that Sturm’s error bounds readily imply that for semidefinite feasibility problems, the m...
International audienceThe idea of a finite collection of closed sets having "linearly regular interse...
Bauschke, Borwein, and Lewis have stated a trichotomy theorem [4, Theorem 5.7.16] that characterizes...