Related papers: On location of maximum of gradient of torsion func…

We investigate the location of the maximal gradient of the torsion function on certain non-symmetric planar domains. First, by establishing uniform estimates for convex narrow domains, we show that as a planar domain bounded by two graphs…

The torsion function of a convex planar domain has convex level sets, but explicit formulae are known only for rectangles and ellipses. Here we study the torsion function on convex planar domains of high eccentricity. We obtain an…

Could the location of the maximum point for a positive solution of a semilinear Poisson equation on a convex domain be independent of the form of the nonlinearity? Cima and Derrick found certain evidence for this surprising conjecture. We…

We obtain some sharp estimates for the $p$-torsion of convex planar domains in terms of their area, perimeter, and inradius. The approach we adopt relies on the use of web functions (i.e. functions depending only on the distance from the…

It is well-known that given a bounded, smooth nonconvex function, standard gradient-based methods can find $\epsilon$-stationary points (where the gradient norm is less than $\epsilon$) in $\mathcal{O}(1/\epsilon^2)$ iterations. However,…

In a domain of the Euclidean space, we estimate from below the distance to the boundary of global maximum points of solutions of elliptic and parabolic equations with homogeneous Dirichlet boundary values. As reference cases, we first…

Given a smooth simply connected planar domain, the area is bounded away from zero in terms of the maximal curvature alone. We show that in higher dimensions this is not true, and for a given maximal mean curvature we provide smooth…

The problem of finding the minimizer of a sum of convex functions is central to the field of distributed optimization. Thus, it is of interest to understand how that minimizer is related to the properties of the individual functions in the…

Consider $J(\Omega):= \|\nabla u_\Omega\|_\infty/\sqrt{|\Omega|} $ and $J_P(\Omega):= \|\nabla u_\Omega\|_\infty/P(\Omega) $, where $\Omega$ is a planar convex domain, $u_\Omega$ is the torsion function, $P(\Omega)$ is the perimeter of…

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…

We obtain an upper bound on the lowest magnetic Neumann eigenvalue of a bounded, convex, smooth, planar domain with moderate intensity of the homogeneous magnetic field. This bound is given as a product of a purely geometric factor…

We consider the minimization of non-convex quadratic forms regularized by a cubic term, which exhibit multiple saddle points and poor local minima. Nonetheless, we prove that, under mild assumptions, gradient descent approximates the…

Motivated by the geometric reduction of Cauchy--Szeg\H{o} projections on quadratic surfaces of higher codimension (Nagel--Ricci--Stein, 2001) and recent developments on the real-variable theory adapted to twisted multiparameter structures…

We establish a spatial gradient maximum principle for classical solutions to the initial and Neumann boundary value problem of some quasilinear parabolic equations on smooth convex domains.

Let $\Omega \subset \mathbb{R}^2$ be a bounded, convex domain and let $u$ be the solution of $-\Delta u = 1$ vanishing on the boundary $\partial \Omega$. The estimate $$ \| \nabla u\|_{L^{\infty}(\Omega)} \leq c |\Omega|^{1/2}$$ is…

The maximum function, on vectors of real numbers, is not differentiable. Consequently, several differentiable approximations of this function are popular substitutes. We survey three smooth functions which approximate the maximum function…

In this paper we study extremal behaviors of the mean to max ratio of the $p$-torsion function with respect to the geometry of the domain. For $p$ larger than the dimension of the space $N$, we prove that the upper bound is uniformly below…

We establish a maximum principle for a two-point function in order to analyze the convexity of level sets of harmonic functions. We show that this can be used to prove a strict convexity result involving the smallest principal curvature of…

A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…

We prove a spectral upper bound for the torsion function of symmetric stable processes that holds for convex domains in $\mathbb{R}^d$. Our bound is explicit and captures the correct order of growth in $d$, improving upon the existing…