25 citations · 77 across the 32 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.OC2026
A Gradient Sampling Algorithm for Noisy Nonsmooth Nonconvex Optimization
Albert S. Berahas, Frank E. Curtis, Lara Zebiane
An algorithm is proposed, analyzed, and tested for minimizing locally Lipschitz objective functions that may be nonconvex and/or nonsmooth. The algorithm, which is built upon the g…
math.OC2026
Negative Curvature Methods with High-Probability Complexity Guarantees for Stochastic Nonconvex Optimization
Albert S. Berahas, Raghu Bollapragada, Wanping Dong
This paper develops negative curvature methods for continuous nonlinear unconstrained optimization in stochastic settings, in which function, gradient, and Hessian information is a…