2 papers
math.OC2025
Complexity guarantees and polling strategies for Riemannian direct-search methods
Bastien Cavarretta, Florentin Goyens, Clément W. Royer +1
Direct-search algorithms are derivative-free optimization techniques that operate by polling the variable space along specific directions forming positive spanning sets (PSSs). Whe…
math.OC2024
Riemannian trust-region methods for strict saddle functions with complexity guarantees
Florentin Goyens, Clément W. Royer
The difficulty of minimizing a nonconvex function is in part explained by the presence of saddle points. This slows down optimization algorithms and impacts worst-case complexity g…