AbstractThe rate of convergence for the cyclic projections algorithm onto an intersection of finitely many closed convex sets in a Hilbert space is investigated. Recently we showed that this rate could be described in terms of the “angles” between the convex sets involved. Here we show that these angles may often be described in terms of the “norms” of certain nonlinear operators, and hence obtain an alternate way of computing this rate of convergence
Abstract. Given N ≥ 2 closed subspaces M1, . . . , MN of a Hilbert space X, let Pk denote the orthog...
International audienceThe idea of a finite collection of closed sets having "linearly regular interse...
AbstractA new iterative method for finding the projection onto the intersection of two closed convex...
AbstractThe rate of convergence for the cyclic projections algorithm onto an intersection of finitel...
AbstractThe cyclic projections algorithm is an important method for determining a point in the inter...
In this paper, we study the rate of convergence of the cyclic projection algorithm applied to finite...
In this paper, we study the rate of convergence of the cyclic projection algorithm applied to finite...
We show that cyclic products of projections onto convex subsets of Hadamard spaces can behave in a m...
Dykstra's cyclic projections algorithm allows one to compute best approximations to any pointx in a ...
AbstractWe provide sufficient conditions for strong and uniform (on bounded subsets of initial point...
We show that cyclic products of projections onto convex subsets of Hadamard spaces can behave in a m...
AbstractWe establish convergence theorems for two different block-iterative methods for solving the ...
We study the method of cyclic projections when applied to closed and linear subspaces $M_i$, $i=1,\l...
summary:The method of projections onto convex sets to find a point in the intersection of a finite n...
AbstractThe purpose of the paper is threefold:(1) To develop a useful error bound for the method of ...
Abstract. Given N ≥ 2 closed subspaces M1, . . . , MN of a Hilbert space X, let Pk denote the orthog...
International audienceThe idea of a finite collection of closed sets having "linearly regular interse...
AbstractA new iterative method for finding the projection onto the intersection of two closed convex...
AbstractThe rate of convergence for the cyclic projections algorithm onto an intersection of finitel...
AbstractThe cyclic projections algorithm is an important method for determining a point in the inter...
In this paper, we study the rate of convergence of the cyclic projection algorithm applied to finite...
In this paper, we study the rate of convergence of the cyclic projection algorithm applied to finite...
We show that cyclic products of projections onto convex subsets of Hadamard spaces can behave in a m...
Dykstra's cyclic projections algorithm allows one to compute best approximations to any pointx in a ...
AbstractWe provide sufficient conditions for strong and uniform (on bounded subsets of initial point...
We show that cyclic products of projections onto convex subsets of Hadamard spaces can behave in a m...
AbstractWe establish convergence theorems for two different block-iterative methods for solving the ...
We study the method of cyclic projections when applied to closed and linear subspaces $M_i$, $i=1,\l...
summary:The method of projections onto convex sets to find a point in the intersection of a finite n...
AbstractThe purpose of the paper is threefold:(1) To develop a useful error bound for the method of ...
Abstract. Given N ≥ 2 closed subspaces M1, . . . , MN of a Hilbert space X, let Pk denote the orthog...
International audienceThe idea of a finite collection of closed sets having "linearly regular interse...
AbstractA new iterative method for finding the projection onto the intersection of two closed convex...