2 papers
math.OC2026
Smooth, globally Polyak-Łojasiewicz functions are nonlinear least-squares
Nicolas Boumal, Christopher Criscitiello, Quentin Rebjock
The Polyak-Łojasiewicz (PŁ) condition is often invoked in nonconvex optimization because it allows fast convergence of algorithms beyond strong convexity. A function $f \colon \mat…
math.OC2026
A practical randomized trust-region method to escape saddle points in high dimension
Radu-Alexandru Dragomir, Xiaowen Jiang, Bonan Sun +1
Without randomization, escaping the saddle points of requires at least pieces of information about (values, gradients, Hessian-vec…