30 citations · 33 across the 13 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
math.OC2022
Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization
Warren Hare, Clément W. Royer
Nonconvex minimization algorithms often benefit from the use of second-order information as represented by the Hessian matrix. When the Hessian at a critical point possesses negati…
math.OC2022★ 1 cited
Direct search based on probabilistic descent in reduced spaces
Lindon Roberts, Clément W. Royer
In this paper, we study a generic direct-search algorithm in which the polling directions are defined using random subspaces. Complexity guarantees for such an approach are derived…
math.OC2022★ 1 cited
A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression
Rémi Chan--Renous-Legoubin, Clément W. Royer
Nonlinear conjugate gradients are among the most popular techniques for solving continuous optimization problems. Although these schemes have long been studied from a global conver…