Primal-dual subgradient methods for minimizing uniformly convex functions
From MaRDI portal
Abstract: We discuss non-Euclidean deterministic and stochastic algorithms for optimization problems with strongly and uniformly convex objectives. We provide accuracy bounds for the performance of these algorithms and design methods which are adaptive with respect to the parameters of strong or uniform convexity of the objective: in the case when the total number of iterations is fixed, their accuracy coincides, up to a logarithmic in factor with the accuracy of optimal algorithms.
This page was built for publication: Primal-dual subgradient methods for minimizing uniformly convex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6247937)
