Parallel subgradient algorithm with block dual decomposition for large-scale optimization

DOI10.1016/j.ejor.2021.11.054zbMath1495.65086OpenAlexW4200098951MaRDI QIDQ2077960

Nicoleta Serban, Yuchen Zheng, Ilbin Lee, Amin Dehghanian, Yujia Xie

Publication date: 23 February 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.11.054

zbMATH Keywords

community detectionlarge scale optimizationdistributed decision makingblock dual decompositionparallel subgradient algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06)

Uses Software

• apcluster
• APCluster
• Julia
• AdaGrad

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clustering by Passing Messages Between Data Points
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Smooth minimization of non-smooth functions
• Primal recovery from consensus-based dual decomposition for distributed convex optimization
• Parallel coordinate descent methods for big data optimization
• Block splitting for distributed optimization
• Parallel bundle-based decomposition for large-scale structured mathematical programming problems
• NP-hard and linear variants of hypergraph partitioning
• Finding good approximate vertex and edge partitions is NP-hard
• A genetic algorithm for the multidimensional knapsack problem
• Dual decomposition in stochastic integer programming
• Partitioning mathematical programs for parallel solution
• Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
• Coordinate descent algorithms
• Automatic Dantzig-Wolfe reformulation of mixed integer programs
• Julia: A Fresh Approach to Numerical Computing
• Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
• On convergence rates of subgradient optimization methods
• A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
• Community structure in social and biological networks
• Permuting Sparse Rectangular Matrices into Block-Diagonal Form
• Distributed Subgradient Methods for Multi-Agent Optimization
• Structure Detection in Mixed-Integer Programs
• Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling