English
Related papers

Related papers: Smooth, globally Polyak-{\L}ojasiewicz functions a…

200 papers

A symmetric quadratic form $g$ on a surface~$M$ is said to be locally Hessianizable if each $p\in M$ has an open neighborhood~$U$ on which there exists a local coordinate chart $(x^1,x^2):U\to\mathbb{R}^2$ and a function $f:U\to\mathbb{R}$…

Differential Geometry · Mathematics 2024-05-14 Robert L. Bryant

We provide sufficient conditions for the Lojasiewicz-Simon gradient inequality to hold on a submanifold of a Banach space and discuss the optimality of our assumptions. Our result provides a tool to study asymptotic properties of…

Functional Analysis · Mathematics 2020-07-27 Fabian Rupp

For any $f: \mathbb{R}^n \rightarrow \mathbb{R}_{\geq 0}$ the symmetric decreasing rearrangement $f^*$ satisfies the Polya-Szeg\H{o} inequality $\| \nabla f^*\|_{L^p} \leq \| \nabla f\|_{L^p}$. The goal of this paper is to establish…

Combinatorics · Mathematics 2023-10-06 Stefan Steinerberger

We provide a direct proof of existence and uniqueness of weak solutions to a broad family of strongly nonlinear elliptic equations with lower order terms. The leading part of the operator satisfies general growth conditions settling the…

Analysis of PDEs · Mathematics 2023-03-16 Iwona Chlebicka , Arttu Karppinen , Ying Li

We consider global efficiency of algorithms for minimizing a sum of a convex function and a composition of a Lipschitz convex function with a smooth map. The basic algorithm we rely on is the prox-linear method, which in each iteration…

Optimization and Control · Mathematics 2017-08-16 Dmitriy Drusvyatskiy , Courtney Paquette

We prove global existence for a nonlinear Smoluchowski equation (a nonlinear Fokker-Planck equation) coupled with Navier-Stokes equations in two dimensions. The proof uses a deteriorating regularity estimate and the tensorial structure of…

Analysis of PDEs · Mathematics 2009-11-13 Peter Constantin , Nader Masmoudi

This paper presents the first optimal-rate $p$-th order methods with $p\geq 1$ for finding first and second-order stationary points of non-convex smooth objective functions over Riemannian manifolds. In contrast to the geodesically convex…

Optimization and Control · Mathematics 2026-03-23 David Huckleberry Gutman , George Lobo

Let $L$ be the distinguished Laplacian on the Iwasawa $AN$ group associated with a semisimple Lie group $G$. Assume $F$ is a Borel function on $\mathbb{R}^+$. We give a condition on $F$ such that the kernels of the functions $F(L)$ are…

Analysis of PDEs · Mathematics 2024-09-05 Yulia Kuznetsova , Zhipeng Song

We show that Newton's method converges globally at a linear rate for objective functions whose Hessians are stable. This class of problems includes many functions which are not strongly convex, such as logistic regression. Our linear…

Machine Learning · Computer Science 2018-06-04 Sai Praneeth Karimireddy , Sebastian U. Stich , Martin Jaggi

Probabilistic smoothing is a standard tool for global optimization, but existing methods rely on Gaussian kernels and specific transforms, often resulting in strong hyperparameter sensitivity and limited robustness. We propose a general…

Machine Learning · Computer Science 2026-05-27 Kukyoung Jang , Taehyun Cho , Junrui Zhang , Ping Xu , Kyungjae Lee

Let S be a Sobolev or Orlicz-Sobolev space of functions not necessarily vanishing at the boundary of the domain. We give sufficient conditions on a nonnegative function in S in order that its spherical rearrangement ("Schwartz…

Analysis of PDEs · Mathematics 2010-02-16 Marco Bramanti

We investigate the convergence of a forward-backward-forward proximal-type algorithm with inertial and memory effects when minimizing the sum of a nonsmooth function with a smooth one in the absence of convexity. The convergence is obtained…

Optimization and Control · Mathematics 2014-06-04 Radu Ioan Bot , Ernö Robert Csetnek

In this paper, we consider a class of structured nonconvex nonsmooth optimization problems, in which the objective function is formed by the sum of a possibly nonsmooth nonconvex function and a differentiable function whose gradient is…

Optimization and Control · Mathematics 2024-10-01 Tan Nhat Pham , Minh N. Dao , Rakibuzzaman Shah , Nargiz Sultanova , Guoyin Li , Syed Islam

Most prior work on the convergence of gradient descent (GD) for overparameterized neural networks relies on strong assumptions on the step size (infinitesimal), the hidden-layer width (infinite), or the initialization (large, spectral,…

Machine Learning · Computer Science 2025-05-20 Ziqing Xu , Hancheng Min , Salma Tarmoun , Enrique Mallada , Rene Vidal

This paper studies the problem of distributed Riemannian optimization over a network of agents whose cost functions are geodesically smooth but possibly geodesically non-convex. Extending a well-known distributed optimization strategy…

Signal Processing · Electrical Eng. & Systems 2026-05-26 Xiuheng Wang , Ricardo Borsoi , Cédric Richard , Ali H. Sayed

In this article we prove modular and norm P\'olya-Szeg\"o inequalities in general fractional Orlicz-Sobolev spaces by using the polarization technique. We introduce a general framework which includes the different definitions of theses…

Analysis of PDEs · Mathematics 2020-01-20 Pablo de Nápoli , Julián Fernández Bonder , Ariel Salort

We show that wave maps from Minkowski space $R^{1+n}$ to a sphere are globally smooth if the initial data is smooth and has small norm in the critical Sobolev space $\dot H^{n/2}$ in the high dimensional case $n \geq 5$. A major difficulty,…

Analysis of PDEs · Mathematics 2007-05-23 Terence Tao

The inclusion of spatial smoothing in finite-dimensional particle-based Hamiltonian reductions of the Vlasov equation are considered. In the context of the Vlasov-Poisson equation (and other mean-field Lie-Poisson systems), smoothing…

Mathematical Physics · Physics 2024-05-07 William Barham , Philip J. Morrison

This paper studies least-square regression penalized with partly smooth convex regularizers. This class of functions is very large and versatile allowing to promote solutions conforming to some notion of low-complexity. Indeed, they force…

Optimization and Control · Mathematics 2014-07-01 Samuel Vaiter , Gabriel Peyré , Jalal M. Fadili

In this paper, we study the problem of optimizing a two-layer artificial neural network that best fits a training dataset. We look at this problem in the setting where the number of parameters is greater than the number of sampled points.…

Machine Learning · Computer Science 2017-11-01 Digvijay Boob , Guanghui Lan