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…