On the Iteration Complexity of Cyclic Coordinate Gradient Descent Methods

DOI10.1137/130937755zbMath1305.49037OpenAlexW1965129938MaRDI QIDQ2934490

Sangwoon Yun

Publication date: 12 December 2014

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/130937755

zbMATH Keywords

convergence rategradient descent methodnonsmooth convex minimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Decomposition methods (49M27)

Related Items (3)

Inexact variable metric stochastic block-coordinate descent for regularized optimization ⋮ On Faster Convergence of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization ⋮ A generic coordinate descent solver for non-smooth convex optimisation

This page was built for publication: On the Iteration Complexity of Cyclic Coordinate Gradient Descent Methods