Related papers: A note on alternating projections in Hilbert space
The idea of a finite collection of closed sets having "strongly regular intersection" at a given point is crucial in variational analysis. We show that this central theoretical tool also has striking algorithmic consequences. Specifically,…
We establish new and different kinds of proofs of properties that arise due to the orthogonal decomposition of the Hilbert space, including projections, over the unit interval of one dimension. We also see angles between functions,…
We consider the popular and classical method of alternating projections for finding a point in the intersection of two closed sets. By situating the algorithm in a metric space, equipped only with well-behaved geodesics and angles (in the…
Generalized alternating projections is an algorithm that alternates relaxed projections onto a finite number of sets to find a point in their intersection. We consider the special case of two linear subspaces, for which the algorithm…
Alternating projection method has been used in a wide range of engineering applications since it is a gradient-free method (without requiring tuning the step size) and usually has fast speed of convergence. In this paper, we formalize two…
We propose a method for solving constrained fixed point problems involving compositions of Lipschitz pseudo contractive and firmly nonexpansive operators in Hilbert spaces. Each iteration of the method uses separate evaluations of these…
The von Neumann-Halperin method of alternating projections converges strongly to the projection of a given point onto the intersection of finitely many closed affine subspaces. We propose acceleration schemes making use of two ideas:…
The main contributions of this paper are the proposition and the convergence analysis of a class of inertial projection-type algorithm for solving variational inequality problems in real Hilbert spaces where the underline operator is…
In 1933 von Neumann proved a beautiful result that one can approximate a point in the intersection of two convex sets by alternating projections, i.e., successively projecting on one set and then the other. This algorithm assumes that one…
In this work, we consider a class of convex optimization problems in a real Hilbert space that can be solved by performing a single projection, i.e., by projecting an infeasible point onto the feasible set. Our results improve those…
This paper combines two ingredients in order to get a rather surprising result on one of the most studied, elegant and powerful tools for solving convex feasibility problems, the method of alternating projections (MAP). Going back to names…
If $K$ and $L$ are mutually dual closed convex cones in a Hilbert space with the metric projections onto them denoted by $P_K$ and $P_L$ respectively, then the following two assertions are equivalent: (i) $P_K$ is isotone with respect to…
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…
We work out details of the extrinsic geometry for two Hilbert schemes of some contemporary interest: the Hilbert scheme of two points on the projective plane and the dense open set parametrizing non-planar clusters in the punctual Hilbert…
In this paper, we consider the feasibility problem, which aims to find a feasible point for the constraint set $\{x \in \mathbb{R}^n: c(x) = 0\}$ over a possibly non-regular subset $\mathcal{X} \subset \mathbb{R}^n$. Under the constraint…
We introduce a relaxed-projection splitting algorithm for solving variational inequalities in Hilbert spaces for the sum of nonsmooth maximal monotone operators, where the feasible set is defined by a nonlinear and nonsmooth continuous…
In this paper we find the optimal error bound (smallest possible estimate, independent of the starting point) for the linear convergence rate of the simultaneous projection method applied to closed linear subspaces in a real Hilbert space.…
We analyze the performance of alternating minimization for loss functions optimized over two variables, where each variable may be restricted to lie in some potentially nonconvex constraint set. This type of setting arises naturally in…
We show that in the framework of CAT(0) spaces, any convex combination of two mappings which are firmly nonexpansive -- or which satisfy the more general property $(P_2)$ -- is asymptotically regular, conditional on its fixed point set…
We consider subsemimodules and convex subsets of semimodules over semirings with an idempotent addition. We introduce a nonlinear projection on subsemimodules: the projection of a point is the maximal approximation from below of the point…