Parallel block coordinate descent methods with identification strategies

DOI10.1007/S10589-026-00773-5MaRDI QIDQ7262394zbMATH OpenFDO

Authors R. Lopes, S. A. Santos, Paulo José da Silva e Silva

Publication date 11 June 2026

Published in Computational Optimization and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10589-026-00773-5

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX) Mathematical programming (90Cxx)

Cites work

• A coordinate gradient descent method for nonsmooth separable minimization
• A note on the concept of multiset
• Accelerating block coordinate descent methods with identification strategies
• An efficient parallel block coordinate descent algorithm for large-scale precision matrix estimation using graphics processing units
• Approximation accuracy, gradient methods, and error bound for structured convex optimization
• Asynchronous parallel algorithms for nonconvex optimization
• Asynchronous stochastic coordinate descent: parallelism and convergence properties
• Avoiding Communication in Primal and Dual Block Coordinate Descent Methods
• Benchmarking optimization software with performance profiles.
• Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
• Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization
• Coordinate descent methods beyond smoothness and separability
• Distributed coordinate descent method for learning with big data
• Efficiency of coordinate descent methods on huge-scale optimization problems
• Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization
• Fastest rates for stochastic mirror descent methods
• Gradient methods for minimizing composite functions
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• scientific article; zbMATH DE number 852532 (Why is no real title available?)
• Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
• On the Accurate Identification of Active Constraints
• On the complexity of parallel coordinate descent
• On the convergence of block coordinate descent type methods
• Parallel coordinate descent methods for big data optimization
• Parallel random coordinate descent method for composite minimization: convergence analysis and error bounds
• Separable approximations and decomposition methods for the augmented Lagrangian

This page was built for publication: Parallel block coordinate descent methods with identification strategies

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