Universal composite prox-method for strictly convex optimization problems
Not on the map. Why?
Abstract (arXiv)
We propose a simple way to explain Univerasal method of Yu. Nesterov. Based on this method and using the restart technique we propose Universal method for strictly convex optimization problems. We consider general proximal set up (not necessarily euclidian one).
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 24 Mar 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1.
1 paper.