# Universal composite prox-method for strictly convex optimization problems

arXiv: https://arxiv.org/abs/1603.07701 · HTML: https://mlsanity.com/paper/1603.07701/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 24 Mar 2016.

## Built on by (most cited first, 1 of 1)

- [Algorithm for Constrained Markov Decision Process with Linear Convergence](https://mlsanity.com/paper/2206.01666/) (2022)

## 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).