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…