Related papers: Sharp comparison and maximum principles via horizo…
We will generalize a Maximum Principle at Infinity in the parabolic case given by De Lima [Ann. Global Anal. Geom. ${\bf 20}$, 325-343 2001] and De Lima and Meeks [Indiana Univ. Math. Journal ${\bf 53}$ 5, 1211-1223 2004], for disjoints…
In a Hilbert setting, for convex differentiable optimization, we consider accelerated gradient dynamics combining Tikhonov regularization with Hessian-driven damping. The Tikhonov regularization parameter is assumed to tend to zero as time…
We study maximal horizontal subgroups of Carnot groups of Heisenberg type. We classify those of dimension half of that of the canonical distribution ("lagrangians") and illustrate some notable ones of small dimension. An infinitesimal…
In this paper, we prove a Brezis-Merle type inequality for $k$-convex functions vanishing on the boundary. As an application, we establish an Alexandrov-Bakelman-Pucci type estimate for the intermediate Hessian equation. Furthermore, we…
Proximal splitting algorithms for monotone inclusions (and convex optimization problems) in Hilbert spaces share the common feature to guarantee for the generated sequences in general weak convergence to a solution. In order to achieve…
In this paper we deal with lacunary and full versions of the spherical maximal function on the Heisenberg group $\mathbb{H}^n$, for $n\ge 2$. By suitable adaptation of an approach developed by M. Lacey in the Euclidean case, we obtain…
In this paper, we investigate the strong maximum principle for generalized solutions of Monge-Amp\`ere type equations. We prove that the strong maximum principle holds at points where the function is strictly convex but not necessarily…
By time discretization of a second-order primal-dual dynamical system with damping $\alpha/t$ where an inertial construction in the sense of Nesterov is needed only for the primal variable, we propose a fast primal-dual algorithm for a…
In this work, we develop new optimization algorithms that use approximate second-order information combined with the gradient regularization technique to achieve fast global convergence rates for both convex and non-convex objectives. The…
In a real Hilbert space setting, we investigate the asymptotic behavior of the solutions of the classical Arrow-Hurwicz differential system combined with Tikhonov regularizing terms. Under some newly proposed conditions on the Tikhonov…
Near an optimal learning point of a neural network, the learning performance of gradient descent dynamics is dictated by the Hessian matrix of the loss function with respect to the network parameters. We characterize the Hessian…
We prove optimal concentration of measure for lifted functions on high dimensional expanders (HDX). Let $X$ be a $k$-dimensional HDX. We show for any $i\leq k$ and $f:X(i)\to [0,1]$: \[\Pr_{s\in X(k)}\left[\left|\underset{{t\subseteq…
We provide a version of the transference principle. It says that certain optimization problems for functions on the circle, the interval, and the line have the same answers. In particular, we show that the sharp constants in the…
In this paper, we prove the anisotropic Shannon inequality for the Renyi entropy with the best constant on Folland-Stein homogeneous Lie groups. As a consequence, we also prove the optimal Shannon inequality in the same setting. Using a…
Given a proper convex lower semicontinuous function defined on a Hilbert space and whose solution set is supposed nonempty. For attaining a global minimizer when this convex function is continuously differentiable, we approach it by a…
In this paper, we show that for a broad class of pseudoconvex formal-analytic arithmetic surfaces over $\text{Spec}(\mathbb{Z})$, those which admit a nonconstant monic such regular function, that a conjecture of Bost-Charles that the ring…
We use variational arguments to introduce a notion of mean curvature for surfaces in the Heisenberg group H^1 endowed with its Carnot-Carath\'eodory distance. By analyzing the first variation of area, we characterize C^2 stationary surfaces…
Let $\Delta_m$ be the standard $m$-dimensional simplex of non-negative $m+1$ tuples that sum to unity and let $S$ be a nonempty subset of $\Delta_m$. A real valued function $h$ defined on a convex subset of a real vector space is $S$-almost…
We develop multi-step gradient methods for network-constrained optimization of strongly convex functions with Lipschitz-continuous gradients. Given the topology of the underlying network and bounds on the Hessian of the objective function,…
Let $n\ge1$ and $B\ge2$. A real-valued function $f$ defined on the $n$-simplex $\Delta_n$ is approximately convex with respect to $\Delta_{B-1}$ iff f(\sum_{i=1}^B t_ix_i) \le \sum_{i=1}^B t_if(x_i) +1 for all $x_1,...,x_B \in \Delta_n$ and…