Two Polyak-Type Step Sizes for Mirror Descent
Not on the map. Why?
Abstract (arXiv)
We propose two Polyak-type step sizes for mirror descent and prove their convergences for minimizing convex locally Lipschitz functions. Both step sizes, unlike the original Polyak step size, do not need the optimal value of the objective function.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 4 Oct 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 1.
1 paper.