Notes on optimization algorithm complexity analysis: oracle lower bounds, information-theoretic limits, and convergence rate tightness.
Papers
| Paper | Venue / Publisher | Status | Materials |
|---|---|---|---|
| Lower Complexity Bounds of First-Order Methods for Convex-Concave Bilinear Saddle-Point Problems (Math. Program., 2024) | Math. Program., 2024 | draft | note only |