Algorithmic Optimality Guarantees for Nonsmooth $H_\infty$ Output-Feedback Policy Search
It is proved that on the exact identity-gauge slice of the extended convex lift, $\varepsilon$-stationarity yields $O(\varepsilon)$-suboptimality on compact exact slices, which in turn yields convergence-rate guarantees for nonsmooth policy-search methods.