Related papers: On the {\L}ojasiewicz Exponent of the Quadratic Sp…
We consider the exponent of \L ojasiewicz inequality $\|\partial\,f(\mathbf z)\| \ge c |f(\mathbf z|^\theta$ for two classes of analytic functions and we will give an explicit estimation for $\theta$. First we consider certain…
Let $F(x) := (f_{ij}(x))_{i=1,\ldots,p; j=1,\ldots,q},$ be a ($p\times q$)-real polynomial matrix and let $f(x)$ be the smallest singular value function of $F(x).$ In this paper, we first give the following {\em nonsmooth} version of \L…
In this letter we study the proximal gradient dynamics. This recently-proposed continuous-time dynamics solves optimization problems whose cost functions are separable into a nonsmooth convex and a smooth component. First, we show that the…
Witsenhausen's problem asks for the maximum fraction $\alpha_n$ of the $n$-dimensional unit sphere that can be covered by a measurable set containing no pairs of orthogonal points. The best upper bounds for $\alpha_n$ are given by…
An iterative optimization method applied to a function $f$ on $\mathbb{R}^n$ will produce a sequence of arguments $\{\mathbf{x}_k\}_{k \in \mathbb{N}}$; this sequence is often constrained such that $\{f(\mathbf{x}_k)\}_{k \in \mathbb{N}}$…
Let h = \sum h_{\alpha \beta} X^\alpha Y^\beta be a polynomial with complex coefficients. The Lojasiewicz exponent of the gradient of h at infinity is the upper bound of the set of all real \lambda such that |grad h(x, y)| >=…
This paper considers the optimization problem of the form $\min_{{\bf x}\in{\mathbb R}^d} f({\bf x})\triangleq \frac{1}{n}\sum_{i=1}^n f_i({\bf x})$, where $f(\cdot)$ satisfies the Polyak--{\L}ojasiewicz (PL) condition with parameter $\mu$…
The Tomas-Stein inequality for a compact subset $\Gamma$ of the sphere $S^d$ states that the mapping $f\mapsto \widehat{f\sigma}$ is bounded from $L^2(\Gamma,\sigma)$ to $L^{2+4/d}(\R^{d+1})$. Then conditional on a strict comparison between…
We prove a lower bound for the first eigenvalue of the sub-Laplacian on sub-Riemannian manifolds with transverse symmetries. When the manifold is of H-type, we obtain a corresponding rigidity result: If the optimal lower bound for the first…
This paper considers distributed optimization for minimizing the average of local nonconvex cost functions, by using local information exchange over undirected communication networks. To reduce the required communication capacity, we…
Polyak-{\L}ojasiewicz (PL) [Polyak, 1963] condition is a weaker condition than the strong convexity but suffices to ensure a global convergence for the Gradient Descent algorithm. In this paper, we study the lower bound of algorithms using…
Quadratically regularized optimal transport (QOT) is an alternative to entropic regularization that yields sparse couplings and avoids numerical instabilities due to exponential scaling. From an optimization viewpoint, the dual QOT…
We consider the problem of minimizing a convex function that depends on an uncertain parameter $\theta$. The uncertainty in the objective function means that the optimum, $x^*(\theta)$, is also a function of $\theta$. We propose an…
A sequential quadratic optimization algorithm for minimizing an objective function defined by an expectation subject to nonlinear inequality and equality constraints is proposed, analyzed, and tested. The context of interest is when it is…
In this paper, we prove an extension theorem for spheres of square radii in $\mathbb{F}_q^d$, which improves a result obtained by Iosevich and Koh (2010). Our main tool is a new point-hyperplane incidence bound which will be derived via a…
In this paper, we study the Kurdyka-{\L}ojasiewicz (KL) exponent, an important quantity for analyzing the convergence rate of first-order methods. Specifically, we develop various calculus rules to deduce the KL exponent of new (possibly…
This paper focuses on the decentralized optimization (minimization and saddle point) problems with objective functions that satisfy Polyak-{\L}ojasiewicz condition (PL-condition). The first part of the paper is devoted to the minimization…
The aim of this paper is to give a short overview on error bounds and to provide the first bricks of a unified theory. Inspired by the works of [8, 15, 13, 16, 10], we show indeed the centrality of the Lojasiewicz gradient inequality. For…
We strengthen some estimations of the local and global {\L}ojasiewicz exponent for polynomial mappings on closed semialgebraic sets obtained by K.Kurdyka, S.Spodzieja and A.Szlachci\'nska.
We show an effective method to compute the \L ojasiewicz exponent of an arbitrary sheaf of ideals of $\OO_X$, where $X$ is a non-singular scheme. This method is based on the algorithm of resolution of singularities.