3 papers
math.OC2026
Polling Set Construction and Worst-Case Complexity for Direct Search under Polyhedral Convex Constraints
Lindon Roberts, Clément W. Royer
Direct search is one of the most popular derivative-free optimization paradigms, that relies on exploring the variable space using polling directions. To analyze and implement dire…
math.OC2026
Direct-search methods for decentralized blackbox optimization
El Houcine Bergou, Youssef Diouane, Vyacheslav Kungurtsev +1
Derivative-free optimization algorithms are particularly useful for tackling blackbox optimization problems where the objective function arises from complex and expensive procedure…
math.OC2025
Direct-search methods in the year 2025: Theoretical guarantees and algorithmic paradigms
K. J. Dzahini, F. Rinaldi, C. W. Royer +1
Optimizing a function without using derivatives is a challenging paradigm, that precludes from using classical algorithms from nonlinear optimization, and may thus seem intractable…