English
Related papers

Related papers: Upper Minkowski dimension estimates for convex res…

200 papers

Let $A$ and $ B$ be $n\times n$ positive definite complex matrices, let $\sigma$ be a matrix mean, and let $f : [0,\infty)\to [0,\infty)$ be a differentiable convex function with $f(0)=0$. We prove that $$f^{\prime}(0)(A \sigma B)\leq…

Functional Analysis · Mathematics 2024-04-19 Manisha Devi , Jaspal Singh Aujla , Mohsen Kian , Mohammad Sal Moslehian

We study the convolution function $$ C[f(x)] := \int_1^x f(y)f({x\over y}) {{\rm d} y\over y} $$ when $f(x)$ is a suitable number-theoretic error term. Asymptotics and upper bounds for $C[f(x)]$ are derived from mean square bounds for…

Number Theory · Mathematics 2010-11-03 Aleksandar Ivic

Let $\mathfrak{q}>2$ be a prime number, $\chi$ a primitive Dirichlet character modulo $\mathfrak{q}$ and $f$ a primitive holomorphic cusp form or a Hecke-Maass cusp form of level $\mathfrak{q}$ and trivial nebentypus. We prove the subconvex…

Number Theory · Mathematics 2020-05-19 Qingfeng Sun , Hui Wang

For $\alpha > -1$ and $\beta >0, $ let $\mathcal{B}_{\mathcal{H}}^0(\alpha, \beta)$ denote the class of sense preserving harmonic mappings $f=h+\overline{g}$ in the open unit disk $\mathbb{D}$ satisfying $|zh''(z)+\alpha(h'(z)-1)|\leq…

Complex Variables · Mathematics 2021-03-19 Manivannan Mathi , Jugal Kishore Prajapat

A cornerstone in convex analysis is the crucial relationship between functions and their convex conjugate via the Fenchel-Young inequality. In this dual variable setting, the maximal monotonicity of the contact set $ \big\{(x,y) \ \big| \…

Optimization and Control · Mathematics 2023-05-30 Tongseok Lim

Given an operator convex function $f(x)$, we obtain an operator-valued lower bound for $cf(x) + (1-c)f(y) - f(cx + (1-c)y)$, $c \in [0,1]$. The lower bound is expressed in terms of the matrix Bregman divergence. A similar inequality is…

Quantum Physics · Physics 2015-06-17 Isaac H. Kim

Given a compact convex domain $C\subset \mathbb{R}^k$ and bounded measurable functions $f_1,\ldots,f_n:C\to \mathbb{R}$, define the sup-convolution $(f_1\ast \ldots \ast f_n)(z)$ to be the supremum average value of…

Functional Analysis · Mathematics 2023-07-20 Peter van Hintum , Hunter Spink , Marius Tiba

Dimensions of level sets of generic continuous functions and generic H\"older functions defined on a fractal $F$ encode information about the geometry, ``the thickness" of $F$. While in the continuous case this quantity is related to a…

Classical Analysis and ODEs · Mathematics 2024-10-10 Zoltán Buczolich , Balázs Maga , Gáspár Vértesy

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

In this paper we show the following result: if C is an n-dimensional 0-symmetric convex compact set, $f:C\rightarrow[0,1)$ is concave, and $g:[0,1)\rightarrow[0,1)$ is not identically zero, convex, with g(0)=0, then \[ \frac{1}{|C|}\int_C…

Functional Analysis · Mathematics 2020-04-29 Bernardo González Merino

We revisit and prove some convexity inequalities for trace functions conjectured in the earlier part I. The main functional considered is \Phi_{p,q}(A_1,A_2,...,A_m) = (trace((\sum_{j=1}^m A_j^p)^{q/p}))^{1/q} for m positive definite…

Operator Algebras · Mathematics 2008-02-25 Eric A. Carlen , Elliott H. Lieb

Optimizing non-convex functions is a fundamental challenge across machine learning and combinatorial optimization. We introduce and study $\gamma$-weakly $\theta$-up-concavity, a novel first-order condition that characterizes a broad class…

Machine Learning · Computer Science 2026-05-11 Mohammad Pedramfar , Vaneet Aggarwal

Let $M\subset N$ be Hilbert $C^*$-modules over a $C^*$-algebra $A$ with $M^\perp=0$. It was shown recently by J. Kaad and M. Skeide that there exists a non-zero $A$-valued functional on $N$ such that its restriction onto $M$ is zero. Here…

Operator Algebras · Mathematics 2022-05-17 V. Manuilov

A classical result of Hensley provides a sharp lower bound for the functional $\int_\mathbb{R} t^2f$, where $f$ is a non-negative, even log-concave function. In the context of studying the minimal slabs of the unit cube, Barthe and…

Functional Analysis · Mathematics 2025-10-02 Andreas Malliaris , Francisco Marín Sola

We revisit the classical dual ascent algorithm for minimization of convex functionals in the presence of linear constraints, and give convergence results which apply even for non-convex functionals. We describe limit points in terms of the…

Optimization and Control · Mathematics 2016-09-22 Fredrik Andersson , Marcus Carlsson , Carl Olsson

We consider the relaxation of polyconvex functionals with linear growth with respect to the strict convergence in the space of functions of bounded variation. These functionals appears as relaxation of $F(u,\Omega):=\int_\Omega f(\nabla…

Analysis of PDEs · Mathematics 2025-08-18 Riccardo Scala

We prove the local Lipschitz regularity of the minimizers of functionals of the form \[ \mathcal I(u)=\int_\Omega f(\nabla u(x))+g(x)u(x)\,dx\qquad u\in\phi+W^{1,1}_0(\Omega) \] where $g$ is bounded and $\phi$ satisfies the Lower Bounded…

Analysis of PDEs · Mathematics 2025-04-17 Flavia Giannetti , Giulia Treu

In this note, we present two arguments showing that the classical \textit{linear adjoint cone restriction conjecture} holds for the class of functions supported on the cone and invariant under the spatial rotation in all dimensions. The…

Classical Analysis and ODEs · Mathematics 2008-06-20 Shuanglin Shao

Let $(\Omega,g)$ be a piecewise-smooth, bounded convex domain in $\R^2$ and consider $L^2$-normalized Neumann eigenfunctions $\phi_{\lambda}$ with eigenvalue $\lambda^2$ and $u_{\lambda}:= \phi_{\lambda} |_{\partial \Omega}$ the associated…

Analysis of PDEs · Mathematics 2021-01-01 Hans Christianson , John A. Toth

The first two authors of this paper asserted in Lemma 4 of "New Farkas-type constraint qualifications in convex infinite programming" (DOI: 10.1051/cocv:2007027) that a given reverse convex inequality is consequence of a given convex system…

Optimization and Control · Mathematics 2023-05-31 Nguyen Dinh , Miguel A. Goberna , M. Volle