Accelerated dual-averaging primal–dual method for composite convex minimization

DOI10.1080/10556788.2020.1713779zbMath1454.90059arXiv2001.05537OpenAlexW2999988540WikidataQ126329485 ScholiaQ126329485MaRDI QIDQ5135253

No author found.

Publication date: 19 November 2020

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.05537

zbMATH Keywords

accelerationsparse dataprimal-dualempirical risk minimizationdual averaging algorithm

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem

Uses Software

• Saga

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Primal-dual subgradient methods for convex problems
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• An optimal randomized incremental gradient method
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization
• Katyusha: the first direct acceleration of stochastic gradient methods
• A Proximal Stochastic Gradient Method with Progressive Variance Reduction