2000 character limit reached
Polyak-Łojasiewicz inequality is essentially no more general than strong convexity for $C^2$ functions (2512.05285v1)
Published 4 Dec 2025 in math.OC
Abstract: The Polyak-Łojasiewicz (PŁ) inequality extends the favorable optimization properties of strongly convex functions to a broader class of functions. In this paper, we show that the richness of the class of PŁ functions is rooted in the nonsmooth case since sufficient regularity forces them to be essentially strongly convex. More precisely, we prove that if $f$ is a $C2$ PŁ function having a bounded set of minimizers, then it has a unique minimizer and is strongly convex on a sublevel set of the form ${f\leq a}$.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.