Random Coordinate Descent Algorithms for Multi-Agent Convex Optimization Over Networks

From MaRDI portal
Publication:5353298

DOI10.1109/TAC.2013.2250071zbMath1369.90124MaRDI QIDQ5353298

Ion Necoara

Publication date: 8 September 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)




Related Items (18)

Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problemsSelective bi-coordinate variations for resource allocation type problemsOn optimal probabilities in stochastic coordinate descent methodsParallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error BoundsActive-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line SearchRandom block coordinate descent methods for linearly constrained optimization over networksDistributed constraint-coupled optimization via primal decomposition over random time-varying graphsAn almost cyclic 2-coordinate descent method for singly linearly constrained problemsDistributed safe resource allocation using barrier functionsDistributed gradient algorithm for constrained optimization with application to load sharing in power systemsRandom Coordinate Descent Methods for Nonseparable Composite OptimizationFaster convergence of a randomized coordinate descent method for linearly constrained optimization problemsBlocks of coordinates, stochastic programming, and marketsEfficient random coordinate descent algorithms for large-scale structured nonconvex optimizationA distributed asynchronous method of multipliers for constrained nonconvex optimizationDistributed resource allocation on dynamic networks in quadratic timeUnnamed ItemA dual approach for optimal algorithms in distributed optimization over networks




This page was built for publication: Random Coordinate Descent Algorithms for Multi-Agent Convex Optimization Over Networks