Universal composite prox-method for strictly convex optimization problems
From MaRDI portal
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 page was built for publication: Universal composite prox-method for strictly convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6271845)
