Related papers: The Method of Alternating Projections
We propose two new alternating direction methods to solve "fully" nonsmooth constrained convex problems. Our algorithms have the best known worst-case iteration-complexity guarantee under mild assumptions for both the objective residual and…
In a previous work we proved that if a finite Borel measure $\mu$ in a Euclidean space has Hausdorff dimension smaller than a positive integer $k$, then the orthogonal projection onto almost every $k$-dimensional linear subspace is…
Gotzmann's persistence theorem enables us to confirm the Hilbert polynomial of a subscheme of projective space by checking the Hilbert function in just two points, regardless of the dimension of the ambient space. We generalise this result…
Modal interpretations constitute a particular approach to associating dynamical variables with physical systems in quantum mechanics. Given the `quantum logical' constraints that are typically adopted by such interpretations, only certain…
This paper presents new variants of the averaged alternating modified reflections (AAMR) method for the best approximation problem. Under a mild constraint qualification, we first show its weak convergence and then establish a convergence…
We introduce and analyze an abstract algorithm that aims to find the projection onto a closed convex subset of a Hilbert space. When specialized to the fixed point set of a quasi nonexpansive mapping, the required sufficient condition…
We study nonperiodic tilings of the line obtained by a projection method with an interval projection structure. We obtain a geometric characterisation of all interval projection tilings that admit substitution rules and describe the set of…
We introduce a new method for the reconstruction of a function from linear measurements by means of oblique projections. The space spanned by the measurement vectors may be different from the subspace in which the function is reconstructed.…
We prove a generalization of van der Corput's difference theorem for sequences of vectors in a Hilbert space. This generalization is obtained by establishing a connection between sequences of vectors in the first Hilbert space with a vector…
In this paper, we consider a class of nonconvex problems with linear constraints appearing frequently in the area of image processing. We solve this problem by the penalty method and propose the iteratively reweighted alternating…
Given a class of objects, a pattern theorem is a powerful result describing their structure. We show that alternating knots exhibit a pattern theorem, and use this result to prove a long-standing conjecture that alternating knots grow rare.…
Though ubiquitous as first-principles models for conservative phenomena, Hamiltonian systems present numerous challenges for model reduction even in relatively simple, linear cases. Here, we present a method for the projection-based model…
Variable projection methods prove highly efficient in solving separable nonlinear least squares problems by transforming them into a reduced nonlinear least squares problem, typically solvable via the Gauss-Newton method. When solving…
We study the method of cyclic projections when applied to closed and linear subspaces $M_i$, $i=1,\ldots,m$, of a real Hilbert space $\mathcal H$. We show that the average distance to individual sets enjoys a polynomial behaviour…
Let H be a Hilbert space, L(H) the algebra of all bounded linear operators on H and <, >_A : H \times H \to C the bounded sesquilinear form induced by a selfadjoint A in L(H), < \xi, \eta >_A = < A \xi, \eta >, \xi, \eta in H. Given T in…
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…
We give a new proof the arithmetic Hilbert-Samuel theorem by using classical reductions in the theory of coherent sheaves, a direct proof in the case of the projective space and the conservation of some numerical invariants, called…
Nonlinear systems arising from time integrators like Backward Euler can sometimes be reformulated as optimization problems, known as incremental potentials. We show through a comprehensive experimental analysis that the widely used…
This paper aims at reviewing and analysing the method of reflections. The latter is an iterative procedure designed to linear boundary value problems set in multiply connected domains. Being based on a decomposition of the domain boundary,…
Shape-constrained inference has wide applicability in bioassay, medicine, economics, risk assessment, and many other fields. Although there has been a large amount of work on monotone-constrained univariate curve estimation, multivariate…