Related papers: A constructive approach to strengthen algebraic de…
Users of program analyses expect that results change predictably in response to changes in their programs, but many analyses fail to provide such robustness. This paper introduces a theoretical framework that provides a unified language to…
We study existence of random elements with partially specified distributions. The technique relies on the existence of a positive extension for linear functionals accompanied by additional conditions that ensure the regularity of the…
We adopt an operator-theoretic perspective to analyze a class of nonlinear fixed-point iterations and discrete-time dynamical systems. Specifically, we study the Krasnoselskij iteration - at the heart of countless algorithmic schemes and…
For a polynomial $P$ mapping the integers into the integers, define an averaging operator $A_{N} f(x):=\frac{1}{N}\sum_{k=1}^N f(x+P(k))$ acting on functions on the integers. We prove sufficient conditions for the $\ell^{p}$-improving…
We prove that the algebraic condition $|p-2| |< {\mathscr Im}{\mathscr A}\xi,\xi>| \leq 2 \sqrt{p-1} < {\mathscr Re}{\mathscr A}\xi,\xi>$ (for any $\xi\in\mathbb{R}^{n}$) is necessary and sufficient for the $L^{p}$-dissipativity of the…
We give some new characterizations of strictly Lipschitz p-summing operators. These operators have been introduced in order to improve the Lipschitz p-summing operators. Therefore, we adapt this definition for constructing other classes of…
The functional properties of a program are often specified by providing a contract for each of its functions. A contract of a function consists of a pair of formulas, called a precondition and a postcondition, which, respectively, should…
Operators such as Carleson operator are known to be bounded on $L^p$ for all $1<p<\infty$, but not from $L^1$ to weak-$L^1$ and from $H^p$ to $L^p$ for each $0<p\leq 1$, the object of this article is to give a estimate for all $0<p<\infty$.…
We investigate some types of composition operators, linear and not, and conditions for some spaces to be mapped into themselves and for the operators to satisfy some good properties.
The unconstrained minimization of a sufficiently smooth objective function $f(x)$ is considered, for which derivatives up to order $p$, $p\geq 2$, are assumed to be available. An adaptive regularization algorithm is proposed that uses…
Let $(A,\mathscr{A},\mu)$ and $(B,\mathscr{B},\nu)$ be probability spaces, let $\mathscr{F}$ be a sub-$\sigma$-algebra of the product $\sigma$-algebra $\mathscr{A}\times\mathscr{B}$, let $X$ be a Banach space, and let $1< p,q< \infty$. We…
We consider $\ell^r$ extensions of Calderon-Zygmund operators on weighted spaces $L^p(w)$ with $w$ an $A_p$ weight and $1 < p < \infty$. We give quantitative estimates of these operators' norm in terms of a given weight's $A_p$…
We propose a new reconstruction operator that aims to recover the missing parts of a function given the observed parts. This new operator belongs to a new, very large class of functional operators which includes the classical regression…
We obtain approximation results for general positive linear operators satisfying mild conditions, when acting on discontinuous functions and absolutely continuous functions having discontinuous derivatives. The upper bounds, given in terms…
Bilinear observation problems arise in many physical and information-theoretic settings, where observables and states enter multiplicatively. Rank-based diagnostics are commonly used in such problems to assess the effective dimensionality…
We study extension theorems for Lipschitz-type operators acting on metric spaces and with values on spaces of integrable functions. Pointwise domination is not a natural feature of such spaces, and so almost everywhere inequalities and…
This paper presents a theory for the refinement of shared-memory concurrent algorithms from specifications. We augment pre and post condition specifications with Jones' rely and guarantee conditions, all of which are encoded as commands…
The problem of interest is the minimization of a nonlinear function subject to nonlinear equality constraints using a sequential quadratic programming (SQP) method. The minimization must be performed while observing only noisy evaluations…
Coverage functions are an important subclass of submodular functions, finding applications in machine learning, game theory, social networks, and facility location. We study the complexity of partial function extension to coverage…
In this paper we establish a multivariable non-commutative generalization of L\"owner's classical theorem from 1934 characterizing operator monotone functions as real functions admitting analytic continuation mapping the upper complex…