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…