Parallel subgradient algorithm with block dual decomposition for large-scale optimization
type: Item
instance of: scholarly article
title: Parallel subgradient algorithm with block dual decomposition for large-scale optimization
zbMATH Open document ID: 1495.65086
author: Yuchen Zheng
author: Y. J. Xie
author: Ilbin Lee
author: Amin Dehghanian
author: Nicoleta Serban
published in: European Journal of Operational Research
publication date: 2022-02-23T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 7479780
zbMATH Keywords: distributed decision making
zbMATH Keywords: community detection
zbMATH Keywords: block dual decomposition
zbMATH Keywords: large scale optimization
zbMATH Keywords: parallel subgradient algorithm
describes a project that uses: APCluster
describes a project that uses: Julia
describes a project that uses: AdaGrad
describes a project that uses: apcluster
MaRDI profile type: Publication
full work available at URL: j.ejor.2021.11.054
OpenAlex ID: W4200098951
cites work: Q5688506
cites work: Permuting Sparse Rectangular Matrices into Block-Diagonal Form
cites work: Automatic Dantzig-Wolfe reformulation of mixed integer programs
cites work: Q4209222
cites work: Julia: A Fresh Approach to Numerical Computing
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: Finding good approximate vertex and edge partitions is NP-hard
cites work: Dual decomposition in stochastic integer programming
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: Q5396673
cites work: Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
cites work: Partitioning mathematical programs for parallel solution
cites work: Clustering by Passing Messages Between Data Points
cites work: Community structure in social and biological networks
cites work: On convergence rates of subgradient optimization methods
cites work: A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
cites work: Structure Detection in Mixed-Integer Programs
cites work: NP-hard and linear variants of hypergraph partitioning
cites work: Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
cites work: Q4265265
cites work: Parallel bundle-based decomposition for large-scale structured mathematical programming problems
cites work: Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
cites work: Distributed Subgradient Methods for Multi-Agent Optimization
cites work: Smooth minimization of non-smooth functions
cites work: Block splitting for distributed optimization
cites work: Parallel coordinate descent methods for big data optimization
cites work: Primal recovery from consensus-based dual decomposition for distributed convex optimization
cites work: Coordinate descent algorithms
DOI: 10.1016/J.EJOR.2021.11.054
description: scientific article; zbMATH DE number 7479780