Random block coordinate descent methods for linearly constrained optimization over networks

DOI10.1007/s10957-016-1058-zzbMath1370.90145arXiv1504.06340OpenAlexW835513632MaRDI QIDQ2401516

Yu. E. Nesterov, Ion Necoara, François Glineur

Publication date: 1 September 2017

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

convergence analysisdistributed computationsrandom coordinate descentconvex optimization over networkslinear coupled constraints

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Convex programming (90C25) Large-scale problems in mathematical programming (90C06)

Related Items

Greedy randomized and maximal weighted residual Kaczmarz methods with oblique projection, Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis, A Fast Block Coordinate Descent Method for Solving Linear Least-Squares Problems, Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds, Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search, Random block coordinate descent methods for linearly constrained optimization over networks, An almost cyclic 2-coordinate descent method for singly linearly constrained problems, On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems, On multi-step greedy randomized coordinate descent method for solving large linear least-squares problems, Emergence of price-taking behavior, Faster convergence of a randomized coordinate descent method for linearly constrained optimization problems, A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints, Blocks of coordinates, stochastic programming, and markets, Generalized gradients, bid–ask spreads, and market equilibrium, Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization, A Randomized Coordinate Descent Method with Volume Sampling, A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments, Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization, On the convergence of a randomized block coordinate descent algorithm for a matrix least squares problem, Gauss-Seidel method with oblique direction, Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems, On Adaptive Sketch-and-Project for Solving Linear Systems, Unnamed Item, On solving the densestk-subgraph problem on large graphs, A Kaczmarz Algorithm for Solving Tree Based Distributed Systems of Equations, Linear convergence of prox-SVRG method for separable non-smooth convex optimization problems under bounded metric subregularity, Proximal Gradient Methods for Machine Learning and Imaging

Cites Work

• Unnamed Item
• Parallel coordinate descent methods for big data optimization
• A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
• The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
• Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization
• On the linear convergence of the alternating direction method of multipliers
• Optimal scaling of a gradient method for distributed resource allocation
• Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
• Introductory lectures on convex optimization. A basic course.
• Efficient block-coordinate descent algorithms for the group Lasso
• Random block coordinate descent methods for linearly constrained optimization over networks
• Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
• Accelerated Block-coordinate Relaxation for Regularized Optimization
• Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
• Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties
• Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds
• On Projection Algorithms for Solving Convex Feasibility Problems
• Network Topology and Communication Data Rate for Consensusability of Discrete-Time Multi-Agent Systems
• A Web Aggregation Approach for Distributed Randomized PageRank Algorithms
• Random Coordinate Descent Algorithms for Multi-Agent Convex Optimization Over Networks
• A Distributed Newton Method for Network Utility Maximization—Part II: Convergence
• On the Convergence of Block Coordinate Descent Type Methods