Cover Image

Polyak-Łojasiewicz inequality is essentially no more general than strong convexity for $C^2$ functions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Nejma, Aziz Ben
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Remarks on the Polyak-Lojasiewicz inequality and the convergence of gradient systems
by: de Oliveira, Arthur Castello B., et al.
Published: (2025)

Optimal local linear convergence of Nesterov's accelerated gradient method for $C^2$ functions under the Polyak--Łojasiewicz inequality
by: Feng, Zixu, et al.
Published: (2026)

Non-ergodic linear convergence property of the delayed gradient descent under the strongly convexity and the Polyak-Łojasiewicz condition
by: Choi, Hyung Jun, et al.
Published: (2023)

Acceleration for Polyak-Łojasiewicz Functions with a Gradient Aiming Condition
by: Hermant, Julien
Published: (2026)

Smooth, globally Polyak-Łojasiewicz functions are nonlinear least-squares
by: Boumal, Nicolas, et al.
Published: (2026)

Online Stochastic Gradient Methods Under Sub-Weibull Noise and the Polyak-Łojasiewicz Condition
by: Kim, Seunghyun, et al.
Published: (2021)

Faster Stochastic Algorithms for Minimax Optimization under Polyak--Łojasiewicz Conditions
by: Chen, Lesi, et al.
Published: (2023)

On the Complexity of Finite-Sum Smooth Optimization under the Polyak-Łojasiewicz Condition
by: Bai, Yunyan, et al.
Published: (2024)

High-Probability Bounds for SGD under the Polyak-Lojasiewicz Condition with Markovian Noise
by: Kar, Avik, et al.
Published: (2026)

Genericity of Polyak-Lojasiewicz Inequalities for Entropic Mean-Field Neural ODEs
by: Daudin, Samuel, et al.
Published: (2025)

The ballistic limit of the log-Sobolev constant equals the Polyak-Łojasiewicz constant
by: Chewi, Sinho, et al.
Published: (2024)

Linear Convergence of the Proximal Gradient Method for Composite Optimization Under the Polyak-Łojasiewicz Inequality and Its Variant
by: Kong, Qingyuan, et al.
Published: (2024)

Gradient-Type Methods For Decentralized Optimization Problems With Polyak-Łojasiewicz Condition Over Time-Varying Networks
by: Kuruzov, Ilya, et al.
Published: (2022)

A Local Polyak-Lojasiewicz and Descent Lemma of Gradient Descent For Overparametrized Linear Models
by: Xu, Ziqing, et al.
Published: (2025)

On incremental and semi-global exponential stability of gradient flows satisfying generalized Łojasiewicz inequalities
by: Oliveira, Andreas, et al.
Published: (2026)

Non-convex Stochastic Composite Optimization with Polyak Momentum
by: Gao, Yuan, et al.
Published: (2024)

Minimizing smooth Kurdyka-Łojasiewicz functions via generalized descent methods: Convergence rate and complexity
by: Ahookhosh, Masoud, et al.
Published: (2025)

On the Convergence of the Gradient Descent Method with Stochastic Fixed-point Rounding Errors under the Polyak-Lojasiewicz Inequality
by: Xia, Lu, et al.
Published: (2023)

Low-Temperature Asymptotics of the Poincaré and the log-Sobolev Constants for Łojasiewicz Potentials
by: Nejma, Aziz Ben
Published: (2026)

Polyak-Lojasiewicz Inequality for Quadratically Regularized Optimal Transport
by: González-Sanz, Alberto, et al.
Published: (2026)

Dualities for non-Euclidean smoothness and strong convexity under the light of generalized conjugacy
by: Laude, Emanuel, et al.
Published: (2021)

Convergence of Descent Optimization Algorithms under Polyak-Łojasiewicz-Kurdyka Conditions
by: Bento, G. C., et al.
Published: (2024)

Polyak Minorant Method for Convex Optimization
by: Devanathan, Nikhil, et al.
Published: (2023)

The Method of Ellipcenters for strongly convex minimization
by: Behling, Roger, et al.
Published: (2026)

Polyak's Heavy Ball Method Achieves Accelerated Local Rate of Convergence under Polyak-Lojasiewicz Inequality
by: Kassing, Sebastian, et al.
Published: (2024)

A new use of the Kurdyka-Lojasiewicz property to study asymptotic behaviours of some stochastic optimization algorithms in a non-convex differentiable framework
by: Fest, Jean-Baptiste
Published: (2023)

Accelerating Level-Value Adjustment for the Polyak Stepsize
by: Liu, Anbang, et al.
Published: (2023)

Lyapunov analysis for FISTA under strong convexity
by: Briceño-Arias, Luis M.
Published: (2025)

A $\sqrt{2}$-accelerated FISTA for composite strongly convex problems
by: Ushiyama, Kansei
Published: (2025)

Universal subgradient and proximal bundle methods for convex and strongly convex hybrid composite optimization
by: Guigues, Vincent, et al.
Published: (2024)

Adaptive Polyak Stepsize with Level-value Adjustment for Distributed Optimization
by: Ouyang, Chen, et al.
Published: (2026)

Study of the behaviour of Nesterov Accelerated Gradient in a non convex setting: the strongly quasar convex case
by: Hermant, Julien, et al.
Published: (2024)

A feedback control approach to convex optimization with inequality constraints
by: Cerone, V., et al.
Published: (2024)

Hypodifferentials of nonsmooth convex functions and their applications to nonsmooth convex optimization
by: Dolgopolik, M. V.
Published: (2023)

On extending the class of convex functions
by: Mohan, Shravan
Published: (2025)

About some works of Boris Polyak on convergence of gradient methods and their development
by: Ablaev, Seydamet, et al.
Published: (2023)

Exact Convergence rate of the subgradient method by using Polyak step size
by: Zamani, Moslem, et al.
Published: (2024)

Convergence rates of regularized quasi-Newton methods without strong convexity
by: Wang, Shida, et al.
Published: (2025)

Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-Łojasiewicz Inequality
by: Aktas, Fatih Selim, et al.
Published: (2025)

Polyak Stepsize: Estimating Optimal Functional Values Without Parameters or Prior Knowledge
by: Abdukhakimov, Farshed, et al.
Published: (2025)