Related papers: Error Bounds for the Method of Simultaneous Projec…
The numerical properties of algorithms for finding the intersection of sets depend to some extent on the regularity of the sets, but even more importantly on the regularity of the intersection. The alternating projection algorithm of von…
The problem of the minimization of least squares functionals with $\ell^1$ penalties is considered in an infinite dimensional Hilbert space setting. While there are several algorithms available in the finite dimensional setting there are…
We provide new conditions under which the alternating projection sequence converges in norm for the convex feasibility problem where a linear subspace with finite codimension $N\geq 2$ and a lattice cone in a Hilbert space are considered.…
Projective splitting is a family of methods for solving inclusions involving sums of maximal monotone operators. First introduced by Eckstein and Svaiter in 2008, these methods have enjoyed significant innovation in recent years, becoming…
Motivated by the success of Sinkhorn's algorithm for entropic optimal transport, we study convergence properties of iterative proportional fitting procedures (IPFP) used to solve more general information projection problems. We establish…
Convergence of a projected stochastic gradient algorithm is demonstrated for convex objective functionals with convex constraint sets in Hilbert spaces. In the convex case, the sequence of iterates ${u_n}$ converges weakly to a point in the…
Let $L_1,L_2,\dots,L_K$ be a family of closed subspaces of a Hilbert space $H$, $L_1\cap \dots \cap L_K =\{0\}$; let $P_k$ be the orthogonal projection onto $L_k$. We consider two types of consecutive projections of an element $x_0\in H$:…
Calculations of the ground state of inhomogeneous many-electron systems involve a solving of the Poisson equation for Coulomb potential and the Schroedinger equation for single-particle orbitals. Due to nonlinearity and complexity this set…
We introduce the notion of consistent error bound functions which provides a unifying framework for error bounds for multiple convex sets. This framework goes beyond the classical Lipschitzian and H\"olderian error bounds and includes…
In this paper, a novel parallel hybrid iterative method is proposed for finding a common element of the set of solutions of a system of equilibrium problems, the set of solutions of variational inequalities for inverse strongly monotone…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
Optimal dimensionality reduction methods are proposed for the Bayesian inference of a Gaussian linear model with additive noise in presence of overabundant data. Three different optimal projections of the observations are proposed based on…
We study finite element approximations of second-order elliptic problems with measure-valued right-hand sides supported on lower-dimensional sets. The exact solution generally lacks $H^1$-regularity due to the source singularity, which…
We propose in this work a subgradient extragradient method with inertial and correction terms for solving equilibrium problems in a real Hilbert space. We obtain that the sequence generated by our proposed method converges weakly to a point…
The seminal result of Johnson and Lindenstrauss on random embeddings has been intensively studied in applied and theoretical computer science. Despite that vast body of literature, we still lack of complete understanding of statistical…
In 1997, Bauschke, Borwein, and Lewis have stated a trichotomy theorem that characterizes when the convergence of the method of alternating projections can be arbitrarily slow. However, there are two errors in their proof of this theorem.…
The motivation of this work stems from the numerical approximation of bounded functions by polynomials satisfying the same bounds. The present contribution makes use of the recent algebraic characterization found in [B. Despr\'es, Numer.…
This paper concerns the question of whether a more direct limit can be used to obtain the limit Hilbert-Kunz multiplicity, a possible candidate for a characteristic zero Hilbert-Kunz multiplicity. The main goal is to establish an…
In our previous work [Singler, SIAM J. Numer. Anal. 52 (2014), no. 2, 852-876], we considered the proper orthogonal decomposition (POD) of time varying PDE solution data taking values in two different Hilbert spaces. We considered various…
We establish efficient approximate counting algorithms for several natural problems in local lemma regimes. In particular, we consider the probability of intersection of events and the dimension of intersection of subspaces. Our approach is…