1 paper · 2 filters
Frank E. Curtis, Daniel P. Robinson, Clément Royer +1
Worst-case complexity guarantees for nonconvex optimization algorithms have been a topic of growing interest. Multiple frameworks that achieve the best known complexity bounds amon…