Related papers: {\L}ojasiewicz inequalities with explicit exponent…

We prove several abstract versions of the Lojasiewicz-Simon gradient inequality for an analytic functional on a Banach space that generalize previous abstract versions of this inequality, weakening their hypotheses and, in particular, the…

In this paper we propose two proximal gradient algorithms for fractional programming problems in real Hilbert spaces, where the numerator is a proper, convex and lower semicontinuous function and the denominator is a smooth function, either…

In this work, we establish that Nesterov's accelerated gradient method, applied to $C^2$ functions satisfying the Polyak--{\L}ojasiewicz inequality around local minimizers, achieves the optimal local linear convergence rate…

Let $\phi(x)=\sum \alpha_n x^n$ be a formal power series with real coefficients, and let $D$ denote differentiation. It is shown that "for every real polynomial $f$ there is a positive integer $m_0$ such that $\phi(D)^mf$ has only real…

Building on Talagrand's proof of the Hoffmann-J{\o}rgensen inequality for $L_p$ spaces and its version for the exponential Orlicz spaces we provide a full characterization of Orlicz functions $\Psi$ for which an analogous inequality holds…

In this note we prove a trace theorem in fractional spaces with variable exponents. To be more precise, we show that if $p\colon\overline{\Omega}\times \overline{\Omega}\to (1,\infty)$ and $q:\partial \Omega \rightarrow (1,\infty)$ are…

Given an entire function $f$ of finite order $\rho$, let $L(z,f)=\sum_{j=0}^{m}b_{j}(z)f^{(k_{j})}(z+c_{j})$ be a linear delay-differential polynomial of $f$ with small coefficients in the sense of $O(r^{\lambda+\varepsilon})+S(r,f)$,…

The classical Remez inequality bounds the maximum of the absolute value of a polynomial $P(x)$ of degree $d$ on $[-1,1]$ through the maximum of its absolute value on any subset $Z$ of positive measure in $[-1,1]$. Similarly, in several…

Let $f_1,\dots,f_k\in\mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an integer $n<x$ such that the fractional parts $\|f_i(n)\|\ll x^{c/k}$ for all $1\le i\le k$ and for some constant…

In this paper we characterize the inequality \begin{equation*} \bigg( \int_0^{\infty} \bigg( \int_0^x \big[ T_{u,b}f^* (t)\big]^r\,dt\bigg)^{\frac{q}{r}} w(x)\,dx\bigg)^{\frac{1}{q}} \le C \, \bigg( \int_0^{\infty} \bigg( \int_0^x [f^*…

Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified value. This generalizes the problem of finding a nearest…

In this article, the authors first introduce the Triebel-Lizorkin-type space $F_{p(\cdot),q(\cdot)}^{s(\cdot),\phi}(\mathbb R^n)$ with variable exponents, and establish its $\varphi$-transform characterization in the sense of Frazier and…

The aim of this short note is to give an alternative proof, which applies to functions of bounded variation in arbitrary domains, of an inequality by Maz'ya that improves Friedrichs inequality. A remarkable feature of such a proof is that…

We introduce a new type of Krasnoselskii's result. Using a simple differentiability condition, we relax the nonexpansive condition in Krasnoselskii's theorem. More clearly, we analyze the convergence of the sequence…

We study the minimization of a convex function $f(X)$ over the set of $n\times n$ positive semi-definite matrices, but when the problem is recast as $\min_U g(U) := f(UU^\top)$, with $U \in \mathbb{R}^{n \times r}$ and $r \leq n$. We study…

Building on the inequalities for homogeneous tetrahedral polynomials in independent Gaussian variables due to R. Lata{\l}a we provide a concentration inequality for non-necessarily Lipschitz functions $f\colon \R^n \to \R$ with bounded…

The aim of this expository article is to present recent developments in the centuries old discussion on the interrelations between continuous and differentiable real valued functions of one real variable. The truly new results include,…

We prove lower bounds on the complexity of finding $\epsilon$-stationary points (points $x$ such that $\|\nabla f(x)\| \le \epsilon$) of smooth, high-dimensional, and potentially non-convex functions $f$. We consider oracle-based complexity…

We prove a matrix inequality for convex functions of a Hermitian matrix on a bipartite space. As an application we reprove and extend some theorems about eigenvalue asymptotics of Schr\"odinger operators with homogeneous potentials. The…

We develop a new proximal-gradient method for minimizing the sum of a differentiable, possibly nonconvex, function plus a convex, possibly non differentiable, function. The key features of the proposed method are the definition of a…