Asynchronous block coordinate gradient method with the communication noise

DOI10.1016/J.CAM.2026.117642MaRDI QIDQ7297152zbMATH OpenFDO

Authors Woocheol Choi, Jongkyu Lee, Sangwoon Yun

Publication date 15 July 2026

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.CAM.2026.117642

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites work

• A coordinate gradient descent method for nonsmooth separable minimization
• Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization
• Coordinate descent algorithms
• Coordinatewise descent methods for leading eigenvalue problem
• Error bound conditions and convergence of optimization methods on smooth and proximally smooth manifolds
• Error bounds and convergence analysis of feasible descent methods: A general approach
• First-order methods almost always avoid strict saddle points
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• scientific article; zbMATH DE number 5223994 (Why is no real title available?)
• Non-ergodic linear convergence property of the delayed gradient descent under the strongly convexity and the Polyak-Łojasiewicz condition
• On search directions for minimization algorithms
• On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization
• Proximal gradient method for nonsmooth optimization over the Stiefel manifold
• Stability of minimization problems and the error bound condition
• The Lezanski-Polyak-Lojasiewicz inequality and the convergence of the gradient projection algorithm

This page was built for publication: Asynchronous block coordinate gradient method with the communication noise

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7297152)