4 papers
Subgame Perfect Methods in Nonsmooth Convex Optimization
Benjamin Grimmer, Alex L. Wang
This paper considers nonsmooth convex optimization with either a subgradient or proximal operator oracle. In both settings, we identify algorithms that achieve the recently introdu…
Some New Insights from Highly Optimized Polyhedral Passages
Raj Gosain, Benjamin Grimmer
A shape possesses Rupert's property if a hole can be cut through it such that a second identical copy of the shape can cleanly pass straight through the interior of the first. Such…
A Universally Optimal Primal-Dual Method for Minimizing Heterogeneous Compositions
Aaron Zoll, Benjamin Grimmer
This paper proposes a universal algorithm for convex minimization problems of the composite form . We allow each to independently range…
Some Unified Theory for Variance Reduced Prox-Linear Methods
Yue Wu, Benjamin Grimmer
This work considers the nonconvex, nonsmooth problem of minimizing a composite objective of the form where the inner mapping is a smooth finite summation or expe…