Universal composite prox-method for strictly convex optimization problems
classification
🧮 math.OC
keywords
methodconvexoptimizationproblemsproposestrictlyuniversalcomposite
read the original abstract
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).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.