Related papers: Approximation of almost diagonal non-linear maps b…

We propose a two-sided Lanczos method for the nonlinear eigenvalue problem (NEP). This two-sided approach provides approximations to both the right and left eigenvectors of the eigenvalues of interest. The method implicitly works with…

Fixed-point equations with Lipschitz operators have been studied for more than a century, and are central to problems in mathematical optimization, game theory, economics, and dynamical systems, among others. When the Lipschitz constant of…

In this paper, the weighted estimates for multilinear pseudo-differential operators were systematically studied in rearrangement invariant Banach and quasi-Banach spaces. These spaces contain the Lebesgue space, the classical Lorentz space…

The Lattice String Approximation algorithm (or LSA algorithm) of M. L. Lapidus and M. van Frankenhuijsen is a procedure that approximates the complex dimensions of a nonlattice self-similar fractal string by the complex dimensions of a…

In the first part of this paper, we consider nonlinear extension of frame theory by introducing bi-Lipschitz maps $F$ between Banach spaces. Our linear model of bi-Lipschitz maps is the analysis operator associated with Hilbert frames,…

Let $E, F, E_0$ be Banach spaces, with $E_0$ a subspace of $E$. For a maximal Banach operator ideal $\mathcal{A}$, we show that a linear operator from $E_0$ to $F$ can be extended to a linear operator from $E$ to $F$ that belongs to…

While the theory of operator approximation with any given accuracy is well elaborated, the theory of {best constrained} constructive operator approximation is still not so well developed. Despite increasing demands from applications this…

Let $U\subseteq\mathbb{R}^{n}$ be open and convex. We show that every (not necessarily Lipschitz or strongly) convex function $f:U\to\mathbb{R}$ can be approximated by real analytic convex functions, uniformly on all of $U$. In doing so we…

This paper describes a suite of algorithms for constructing low-rank approximations of an input matrix from a random linear image of the matrix, called a sketch. These methods can preserve structural properties of the input matrix, such as…

This paper presents a stochastic block-coordinate proximal Newton method for minimizing the sum of a blockwise Lipschitz-continuously differentiable function and a separable nonsmooth convex function. At each iteration, the method randomly…

This work is motivated by a question published in E. Glasner's paper On a question of Kazhdan and Yom Din regarding the possibility to approximate functionals on a Banach space which are almost invariant with respect to an action of a…

We develop a general, functional calculus approach to approximation of $C_0$-semigroups on Banach spaces by bounded completely monotone functions of their generators. The approach comprises most of well-known approximation formulas, yields…

This paper investigates the minimax-optimality of Halpern fixed-point iterations for Lipschitz maps in general normed spaces. Starting from an a priori bound on the orbit of iterates, we derive non-asymptotic estimates for the fixed-point…

It is known that a Lipschitz continuous map from the Euclidean domain to a metric space is metrically differentiable almost everywhere. When the metric space is a Banach space dual to separable, the metric differential has its linear…

A hypodifferential is a compact family of affine mappings that defines a local max-type approximation of a nonsmooth convex function. We present a general theory of hypodifferentials of nonsmooth convex functions defined on a Banach space.…

This paper provides the theoretical foundation for the construction of lattice algorithms for multivariate $L_2$ approximation in the worst case setting, for functions in a periodic space with general weight parameters. Our construction…

We develop a systematic approach to the study of duality for ideals of Lipschitz maps from a metric space to a Banach space, inspired by the classical theory that relates ideals of operators and tensor norms for Banach spaces, by using the…

We show that for any separable reflexive Banach space $X$ and a large class of Banach spaces $E$, including those with a subsymmetric shrinking basis but also all spaces $L_p$ for $1\leq p \leq \infty$, every bounded linear map ${\mathcal…

We present a method to approximate functionals $\text{Tr} \, f(A)$ of very high-dimensional hermitian matrices $A$ represented as Matrix Product Operators (MPOs). Our method is based on a reformulation of a block Lanczos algorithm in tensor…

On any metric space, I provide an intrinsic characterization of those complex-valued functions which are uniform limits of Lipschitz functions. There are applications to function theory on complete Riemannian manifolds and, in particular,…