5 papers · 2 filters
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…
H-invariance theory: A complete characterization of minimax optimal fixed-point algorithms
TaeHo Yoon, Ernest K. Ryu, Benjamin Grimmer
For nonexpansive fixed-point problems, Halpern's method with optimal parameters, its so-called H-dual algorithm, and in fact, an infinite family of algorithms containing them, all…
A Practical Adaptive Subgame Perfect Gradient Method
Alan Luner, Benjamin Grimmer
We present a performant gradient method for smooth convex optimization, drawing inspiration from several recent advances in the field. Our algorithm, the Adaptive Subgame Perfect G…
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…