A review of decentralized optimization focused on information flows of decomposition algorithms
From MaRDI portal
Publication:6164389
DOI10.1016/j.cor.2023.106190MaRDI QIDQ6164389
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Integrated production and logistics planning: contract manufacturing and choice of air/surface transportation
- Coordinating decentralized linear programs by exchange of primal information
- A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
- Partitioning procedures for solving mixed-variables programming problems
- A diagonal quadratic approximation method for large scale linear programs
- On practical resource allocation for production planning and scheduling with period overlapping setups
- Optimal distributed task scheduling in volunteer clouds
- Decentralised scheduling with confidentiality protection
- A survey on Benders decomposition applied to fixed-charge network design problems
- A tailored Benders decomposition approach for last-mile delivery with autonomous robots
- Convergence of the surrogate Lagrangian relaxation method
- Coordination mechanisms with mathematical programming models for decentralized decision-making: a literature review
- On electricity market equilibria with storage: modeling, uniqueness, and a distributed ADMM
- Converging upon basic feasible solutions through Dantzig-Wolfe decomposition
- A resource constrained scheduling problem with multiple independent producers and a single linking constraint: a coal supply chain example
- Planning and design of intermodal hub networks: a literature review
- Linear Convergence and Metric Selection for Douglas-Rachford Splitting and ADMM
- The Decomposition Algorithm for Linear Programs
- Decentralized decomposition algorithms for peer-to-peer linear optimization
- Distributed Sparse Linear Regression
- D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization
- On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
- Multi-Agent Distributed Optimization via Inexact Consensus ADMM
- A Proximal Dual Consensus ADMM Method for Multi-Agent Constrained Optimization
- On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
- Two heuristic methods based on decomposition to the integrated multi-agent supply chain scheduling and distribution problem
- Sensor Network Event Localization via Nonconvex Nonsmooth ADMM and Augmented Lagrangian Methods
- Minimization of unsmooth functionals
- A decentralized coordination algorithm for multi-objective linear programming with block angular structure
- Consensus-based Dantzig-Wolfe decomposition
This page was built for publication: A review of decentralized optimization focused on information flows of decomposition algorithms