Related papers: The Method of Alternating Projections
Slow convergence of cyclic projections implies divergence of random projections and vice versa. Let $L_1,L_2,\dots,L_K$ be a family of $K$ closed subspaces of a Hilbert space. It is well known that although the cyclic product of the…
Many iterative methods for solving optimization or feasibility problems have been invented, and often convergence of the iterates to some solution is proven. Under favourable conditions, one might have additional bounds on the distance of…
For the case where the dependency digraph has no spanning in-tree, we characterize the region of convergence of the basic continuous-time distributed consensus algorithm and show that consensus can be achieved by employing the method of…
Let $A$ be a closed affine subspace and let $B$ be a hyperplane in a Hilbert space. Suppose we are given their associated nearest point mappings $P_A$ and $P_B$, respectively. We present a formula for the projection onto their intersection…
Let M be a von Neumann algebra on a Hilbert space H with a cyclic and separating unit vector \Omega and let \omega be the faithful normal state on M given by \omega(\cdot)=(\Omega,\cdot\Omega). Moreover, let {N_i :i\in I} be a family of von…
We consider algebraic iterative reconstruction methods with applications in image reconstruction. In particular, we are concerned with methods based on an unmatched projector/backprojector pair; i.e., the backprojector is not the exact…
Consider three closed linear subspaces $C_1, C_2,$ and $C_3$ of a Hilbert space $H$ and the orthogonal projections $P_1, P_2$ and $P_3$ onto them. Halperin showed that a point in $C_1\cap C_2 \cap C_3$ can be found by iteratively projecting…
Circumcentered techniques have been shown to significantly accelerate projection-based methods for convex feasibility problems. Motivated by this success, we propose two direct methods with circumcenter acceleration for solving variational…
A general fixed point theorem for isometries in terms of metric functionals is proved under the assumption of the existence of a conical bicombing. It is new even for isometries of Banach spaces as well as for non-locally compact…
We study the convergence rate of the Circumcentered-Reflection Method (CRM) for solving the convex feasibility problem and compare it with the Method of Alternating Projections (MAP). Under an error bound assumption, we prove that both…
This paper deals with a modified iterative projection method for approximating a solution of the hierarchical fixed point problem for a sequene of nearly nonexpansive mappings with respect to a nonexpansive mapping. It is shown that under…
This paper constructs the geometrically natural objects which are associated with any projection tensor field on a manifold with any affine connection. The approaches to projection tensor fields which have been used in general relativity…
This paper is mainly devoted to the following question:\ Let $M,N$ be von~Neumann algebras with $M\subset N$, if there is a completely bounded projection $P\colon \ N\to M$, is there automatically a contractive projection $\widetilde…
The averaged alternating modified reflections algorithm is a projection method for finding the closest point in the intersection of closed convex sets to a given point in a Hilbert space. In this work, we generalize the scheme so that it…
The alternating minimization (AM) method is a fundamental method for minimizing convex functions whose variable consists of two blocks. How to efficiently solve each subproblems when applying the AM method is the most concerned task. In…
The variational inequality problem in finite-dimensional Euclidean space is addressed in this paper, and two inexact variants of the extragradient method are proposed to solve it. Instead of computing exact projections on the constraint…
Many problems in geometric optics or convex geometry can be recast as optimal transport problems: this includes the far-field reflector problem, Alexandrov's curvature prescription problem, etc. A popular way to solve these problems…
Random projections offer an appealing and flexible approach to a wide range of large-scale statistical problems. They are particularly useful in high-dimensional settings, where we have many covariates recorded for each observation. In…
The aim of this paper is to describe the closure of the numerical range of the product of two orthogonal projections in Hilbert space as a closed convex hull of some explicit ellipses parametrized by points in the spectrum. Several…
Projection methods are popular algorithms for iteratively solving feasibility problems in Euclidean or even Hilbert spaces. They employ (selections of) nearest point mappings to generate sequences that are designed to approximate a point in…