Related papers: Generalized relaxation of string averaging operato…
A tight continuous relaxation is a crucial factor in solving mixed integer formulations of many NP-hard combinatorial optimization problems. The (weighted) max $k$-cut problem is a fundamental combinatorial optimization problem with…
We summarize recent works on the stability under disorder of the absolutely continuous spectra of random operators on tree graphs. The cases covered include: Schr\"odinger operators with random potential, quantum graph operators for trees…
We study distributed composite optimization over networks: agents minimize the sum of a smooth (strongly) convex function, the agents' sum-utility, plus a non-smooth (extended-valued) convex one. We propose a general algorithmic framework…
It has been recently proposed to use the operator product expansion to evaluate the expectation values of renormalized operators without the need of a direct computation of the relevant renormalization constants. We test the viability of…
We prove $\ell^2$ estimates for certain discrete maximal operators associated to simplices. These operators are generalizations of the discrete spherical maximal operator.
We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. We study rate of convergence of recursive estimation procedures for the general…
Generalized spectra of differential operators can be related to spectra of preconditioned discretized operators. Obtaining (estimates of) the eigenvalues of the preconditioned discretized operators may lead to better estimating of the…
We propose generic acceleration schemes for a wide class of optimization and iterative schemes based on relaxation and inertia. In particular, we introduce methods that automatically tunes the acceleration coefficients online, and establish…
We present some old and new results on dispersive estimates for Schroedinger equations.
This paper studies the learning of linear operators between infinite-dimensional Hilbert spaces. The training data comprises pairs of random input vectors in a Hilbert space and their noisy images under an unknown self-adjoint linear…
Continuum limits of Laplace operators on general lattices are considered, and it is shown that these operators converge to elliptic operators on the Euclidean space in the sense of the generalized norm resolvent convergence. We then study…
We define sparse operators of strong type on abstract measure spaces with ball-bases. Weak and strong type inequalities for such operators are proved.
In static analysis by abstract interpretation, one often uses widening operators in order to enforce convergence within finite time to an inductive invariant. Certain widening operators, including the classical one over finite polyhedra,…
Truncating the Fourier transform averaged by means of a generalized Hausdorff operator, we approximate the adjoint to that Hausdorff operator of the given function. We find the formulas for the rate of approximation in various metrics in…
This article explains the relationship between analytic and algebraic order in case of abstract pseudo-differential operators for a regular spectral triple.
In this paper, a new generalized Bernstein-Bezier type operators is constructed.The estimates of the moments of these operators are investigated. The rate of convergence in terms of modulus of continuity is given. Then, the equivalent…
We provide a generalization of the idea of unitary designs to cover finite averaging over much more general operations on quantum states. Namely, we construct finite averaging sets for averaging quantum states over arbitrary reductive Lie…
Two-side estimates for two-weighted discrete Hardy-type operators on a tree are obtained. For general weights we prove the discrete analogue of Evans - Harris - Pick theorem (it is a quite simple consequence from their result). It gives the…
We give a new treatment of tabular LR parsing, which is an alternative to Tomita's generalized LR algorithm. The advantage is twofold. Firstly, our treatment is conceptually more attractive because it uses simpler concepts, such as grammar…
We propose a functional description of rewriting systems where reduction rules are represented by linear maps called reduction operators. We show that reduction operators admit a lattice structure. Using this structure we define the notion…