Related papers: On approximately Convex and Affine Sequences
Let $f$ be an inner function with $f(0)=0$ which is not a rotation and let $f^{n}$ be its $n$-th iterate. Let $\{a_{n}\}$ be a sequence of complex numbers. We prove that the series $\sum a_{n}f^{n}(\xi)$ converges at almost every point…
We establish new upper and lower bounds on the number of queries required to test convexity of functions over various discrete domains. 1. We provide a simplified version of the non-adaptive convexity tester on the line. We re-prove the…
Randomized higher-order computation can be seen as being captured by a lambda calculus endowed with a single algebraic operation, namely a construct for binary probabilistic choice. What matters about such computations is the probability of…
Error bounds, which refer to inequalities that bound the distance of vectors in a test set to a given set by a residual function, have proven to be extremely useful in analyzing the convergence rates of a host of iterative methods for…
This work considers the nonconvex, nonsmooth problem of minimizing a composite objective of the form $f(g(x))+h(x)$ where the inner mapping $g$ is a smooth finite summation or expectation amenable to variance reduction. In such settings,…
Following Boros--Moll, a sequence $(a_n)$ is $m$-log-concave if $\mathcal{L}^j (a_n) \geq 0$ for all $j = 0, 1, \ldots, m$. Here, $\mathcal{L}$ is the operator defined by $\mathcal{L} (a_n) = a_n^2 - a_{n - 1} a_{n + 1}$. By a criterion of…
The main result states that every convex set-valued function defined on a real interval with compact values in a locally convex space, admits an affine selection. In the case if the target space is a real line and the values are closed real…
The existence of a homogeneous decomposition for continuous and epi-translation invariant valuations on super-coercive functions is established. Continuous and epi-translation invariant valuations that are epi-homogeneous of degree $n$ are…
In this paper, we give the refinement of an extension of Jensen's inequality to affine combinations. Furthermore, we present the functional form of Jensen's inequality for continuous 3-convex functions of one variable at a point.
Logconcave functions represent the current frontier of efficient algorithms for sampling, optimization and integration in R^n. Efficient sampling algorithms to sample according to a probability density (to which the other two problems can…
This note establishes smooth approximation from above for J-plurisubharmonic functions on an almost complex manifold (X,J). The following theorem is proved. Suppose X is J-pseudoconvex, i.e., X admits a smooth strictly J-plurisubharmonic…
The calculus of finite differences is a solid foundation for the development of operations such as the derivative and the integral for infinite sequences. Here we showed a way to extend it for finite sequences. We could then define…
In this paper we introduce the class of infinite infimal convolution functionals and apply these functionals to the regularization of ill-posed inverse problems. The proposed regularization involves an infimal convolution of a continuously…
Mittag-Leffler condition ensures the exactness of the inverse limit of short exact sequences indexed on a partially ordered set $(I,\leq)$ admitting a $countable$ cofinal subset. We extend Mittag-Leffler condition by relatively relaxing the…
Answering one problem that has its origins in quantum mechanics, we prove that for any sequence $(A_n)_{n\in\mathbb N}$ of convex nowhere dense sets in a Banach space $X$ and any sequence $(\varepsilon_n)_{n=1}^\infty$ of positive real…
A sequence of non-negative integers is called a B_k sequence if all the sums of arbitrary k elements are different. In this paper, we will present a new upper bound for B_3 sequences.
A connected, linearly ordered path $\ga \subset R^n$ satisfying $$ x_1\prec x_2\prec x_3 \in \ga, and x_1 \prec x_2 \prec x_3 \Rightarrow |x_2 - x_1| \leq | x_3 - x_1|$$ is shown to be a rectifiable curve; a priori bounds for its length are…
In a previous paper [Adcock & Huybrechs, 2019] we described the numerical approximation of functions using redundant sets and frames. Redundancy in the function representation offers enormous flexibility compared to using a basis, but…
This paper presents a lower bound for optimizing a finite sum of $n$ functions, where each function is $L$-smooth and the sum is $\mu$-strongly convex. We show that no algorithm can reach an error $\epsilon$ in minimizing all functions from…
A nearly linear recurrence sequence (nlrs) is a complex sequence $(a_n)$ with the property that there exist complex numbers $A_0$,$\ldots$, $A_{d-1}$ such that the sequence $\big(a_{n+d}+A_{d-1}a_{n+d-1}+\cdots +A_0a_n\big)_{n=0}^{\infty}$…