Related papers: Alternating projections between two inconsistent a…

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…

Linear subspace representations of appearance variation are pervasive in computer vision. This paper addresses the problem of robustly matching such subspaces (computing the similarity between them) when they are used to describe the scope…

The diagonal in a product of projective spaces is cut out by the ideal of 2x2-minors of a matrix of unknowns. The multigraded Hilbert scheme which classifies its degenerations has a unique Borel-fixed ideal. This Hilbert scheme is generally…

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,…

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 paper, we study alternating projections on nontangential manifolds based on the tangent spaces. The main motivation is that the projection of a point onto a manifold can be computational expensive. We propose to use the tangent…

The transition amplitudes between coherent states on a coherent state manifold are expressed in terms of the embedding of the coherent state manifold into a projective Hilbert space. Consequences for the dimension of projective Hilbert…

We develop a Hilbert space framework for a number of general multi-scale problems from dynamics. The aim is to identify a spectral theory for a class of systems based on iterations of a non-invertible endomorphism. We are motivated by the…

The method of alternation projections (MAP) is an iterative procedure for finding the projection of a point on the intersection of closed subspaces of an Hilbert space. The convergence of this method is usually slow, and several methods for…

We study the two-set feasibility problem of finding a point in the intersection $X\cap Y$ of closed convex sets in a Hilbert space. We propose a generalized composed alternating relaxed projection algorithm (gCARPA) that blends…

The problem of finding a vector with the fewest nonzero elements that satisfies an underdetermined system of linear equations is an NP-complete problem that is typically solved numerically via convex heuristics or nicely-behaved nonconvex…

We prove the Invariant Subspace Conjecture for separable Hilbert spaces.

We investigate the properties of the simultaneous projection method as applied to countably infinitely many closed and linear subspaces of a real Hilbert space. We establish the optimal error bound for linear convergence of this method,…

The aim of this paper is to investigate the use of an entropic projection method for the iterative regularization of linear ill-posed problems. We derive a closed form solution for the iterates and analyze their convergence behaviour both…

In this paper we generalize a strategy recently proposed by the author concerning intertwining operators. In particular we discuss the possibility of extending our previous results in such a way to construct (almost) isospectral…

Properties of the recently reported homogeneous Hilbert curves are deduced and reported. The nature of the affine transformations involved in the construction of the Hilbert curves is explored. The analytical representation of proper and…

We investigate convergence of alternating Bregman projections between non-convex sets and prove convergence to a point in the intersection, or to points realizing a gap between the two sets. The speed of convergence is generally sub-linear,…

A parallel splitting method is proposed for solving systems of coupled monotone inclusions in Hilbert spaces. Convergence is established for a wide class of coupling schemes. Unlike classical alternating algorithms, which are limited to two…

In this work an intrinsic projectively invariant distance is used to establish a new approach to the study of projective geometry in Finsler space. It is shown that the projectively invariant distance previously defined is a constant…

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,…