English
Related papers

Related papers: The smoothest average: Dirichlet, Fej\'er and Cheb…

200 papers

We study the problem of finding the "smoothest'' local average of a function $f \in \ell^2(\mathbb{Z})$ when we consider its convolution with suitable kernels $u$. The measurement of smoothness is as follows: Given a positive integer $k$,…

Classical Analysis and ODEs · Mathematics 2026-04-29 José Gaitán , Carlos Garzón , José Madrid

We consider functions $f: \mathbb{Z} \to \mathbb{R}$ and kernels $u: \{-n, \cdots, n\} \to \mathbb{R}$ normalized by $\sum_{\ell = -n}^{n} u(\ell) = 1$, making the convolution $u \ast f$ a "smoother" local average of $f$. We identify which…

Classical Analysis and ODEs · Mathematics 2023-10-17 Sean Richardson

Let $f \in L^{2}(\mathbb{R}^n)$ and suppose we are interested in computing its average at a fixed scale. This is easy: we pick the density $u_{}$ of a probability distribution with mean 0 and some moment at the desired scale and compute the…

Classical Analysis and ODEs · Mathematics 2020-05-05 Stefan Steinerberger

In the context of global optimization of mixed-integer nonlinear optimization formulations, we consider smoothing univariate functions $f$ that satisfy $f(0)=0$, $f$ is increasing and concave on $[0,+\infty)$, $f$ is twice differentiable on…

Optimization and Control · Mathematics 2018-10-12 Luze Xu , Jon Lee , Daphne Skipper

Consider an open set $\mathbb{D}\subseteq\mathbb{R}^n$, equipped with a probability measure $\mu$. An important characteristic of a smooth function $f:\mathbb{D}\rightarrow\mathbb{R}$ is its \emph{second-moment matrix} $\Sigma_{\mu}:=\int…

Information Theory · Computer Science 2019-09-10 Armin Eftekhari , Michael B. Wakin , Ping Li , Paul G. Constantine

The proximal average of two convex functions has proven to be a useful tool in convex analysis. In this note, we express Goebel's self-dual smoothing operator in terms of the proximal average, which allows us to give a simple proof of self…

Functional Analysis · Mathematics 2010-03-31 Heinz H. Bauschke , Sarah M. Moffat , Xianfu Wang

We consider the problem of estimating an unknown function f* and its partial derivatives from a noisy data set of n observations, where we make no assumptions about f* except that it is smooth in the sense that it has square integrable…

Machine Learning · Statistics 2024-05-17 Eunji Lim

Let $N\geq 5$, $a>0$, $\Omega$ be a smooth bounded domain in $\mathbb{R}^{N}$, $2^*=\frac{2N}{N-2}$, $2^\#=\frac{2(N-1)}{N-2}$ and $||u||^2=|\nabla u|_{2}^2+a|u|_{2}^2$. We prove there exists an $\alpha_{0}>0$ such that, for all $u\in…

Analysis of PDEs · Mathematics 2014-07-24 Pedro M. Girão

Let $u$ be a smooth convex function in $\mathbb{R}^{n}$ and the graph $M_{\nabla u}$ of $\nabla u$ be a space-like translating soliton in pseudo-Euclidean space $\mathbb{R}^{2n}_{n}$ with a translating vector $\frac{1}{n}(a_{1}, a_{2},…

Analysis of PDEs · Mathematics 2014-09-22 R. L. Huang , R. W. Xu

Let $\mathbf{x}_j = \mathbf{\theta} + \mathbf{\epsilon}_j$, $j=1,\dots,n$ be i.i.d. copies of a Gaussian random vector $\mathbf{x}\sim\mathcal{N}(\mathbf{\theta},\mathbf{\Sigma})$ with unknown mean $\mathbf{\theta} \in \mathbb{R}^d$ and…

Statistics Theory · Mathematics 2020-12-23 Fan Zhou , Ping Li

In the first part we present a generalized implicit function theorem for abstract equations of the type $F(\lambda,u)=0$. We suppose that $u_0$ is a solution for $\lambda=0$ and that $F(\lambda,\cdot)$ is smooth for all $\lambda$, but,…

Analysis of PDEs · Mathematics 2025-12-10 Irina Kmit , Lutz Recke

We give asymptotic formulas for some average values of the Euler function on shifted smooth numbers. The result is based on various estimates on the distribution of smooth numbers in arithmetic progressions which are due to A. Granville and…

Number Theory · Mathematics 2008-10-08 Stefanie S. Loiperdinger , Igor E. Shparlinski

Let $u_\e$ be a solution to the system $$ \mathrm{div}(A_\e(x) \nabla u_{\e}(x))=0 \text{\ in} D, \qquad u_{\e}(x)=g(x,x/\e) \text{\ on}\partial D, $$ where $D \subset \R^d $ ($d \geq 2$), is a smooth uniformly convex domain, and $g$ is…

Analysis of PDEs · Mathematics 2013-10-22 Hayk Aleksanyan , Per Sjölin , Henrik Shahgholian

We prove sharp smoothing properties of the averaging operator defined by convolution with a measure on a smooth nondegenerate curve $\gamma$ in $\mathbb R^d$, $d\ge 3$. Despite the simple geometric structure of such curves, the sharp…

Classical Analysis and ODEs · Mathematics 2022-04-01 Hyerim Ko , Sanghyuk Lee , Sewook Oh

Let $N\geq 5$, $\Omega$ be a smooth bounded domain in $\mathbb{R}^{N}$, ${2^*}=\frac{2N}{N-2}$, $a>0$, $S=\inf\left\{\left. \int_{\mathbb{R}^{N}}|\nabla u|^2\,\right|\,u\in L^{2^*}(\mathbb{R}^{N}), \nabla u\in L^2(\mathbb{R}^{N}),…

Analysis of PDEs · Mathematics 2014-07-25 Pedro M. Girão

In order to solve the minimization of a nonsmooth convex function, we design an inertial second-order dynamic algorithm, which is obtained by approximating the nonsmooth function by a class of smooth functions. By studying the asymptotic…

Optimization and Control · Mathematics 2021-12-20 Xin Qu , Wei Bian

We consider the problem of minimizing the sum of three convex functions: i) a smooth function $f$ in the form of an expectation or a finite average, ii) a non-smooth function $g$ in the form of a finite average of proximable functions…

Optimization and Control · Mathematics 2022-03-25 Konstantin Mishchenko , Peter Richtárik

A new class of continuous valuations on the space of convex functions on $\mathbb{R}^n$ is introduced. On smooth convex functions, they are defined for $i=0,\dots,n$ by \begin{equation*} u\mapsto \int_{\mathbb{R}^n} \zeta(u(x),x,\nabla…

Metric Geometry · Mathematics 2020-07-10 A. Colesanti , M. Ludwig , F. Mussnig

A mathematical smooth function means that the function has continuous derivatives to a certain degree C(k). We call it a k-smooth function or a smooth function if k can grow infinitively. Based on quantum physics, there is no such smooth…

Numerical Analysis · Mathematics 2010-05-21 Li Chen

The usual approach to developing and analyzing first-order methods for smooth convex optimization assumes that the gradient of the objective function is uniformly smooth with some Lipschitz constant $L$. However, in many settings the…

Optimization and Control · Mathematics 2017-10-11 Haihao Lu , Robert M. Freund , Yurii Nesterov
‹ Prev 1 2 3 10 Next ›