Consensus-based Dantzig-Wolfe decomposition
From MaRDI portal
Publication:6167387
DOI10.1016/j.ejor.2022.10.019arXiv1905.03309OpenAlexW3119204606MaRDI QIDQ6167387
No author found.
Publication date: 10 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.03309
column generationprivacydistributed decision makingDantzig Wolfe decompositiondecentralized data storage
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Large-scale optimization with the primal-dual column generation method
- Robust location transportation problems under uncertain demands
- On the linear convergence of the alternating direction method of multipliers
- Privacy-preserving linear programming
- Branching in branch-and-price: A generic scheme
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
- About Lagrangian methods in integer optimization
- A column generation approach to delivery planning over time with inhomogeneous service providers and service interval constraints
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Privacy-preserving horizontally partitioned linear programs with inequality constraints
- Design and implementation of a modular interior-point solver for linear optimization
- New developments in the primal-dual column generation technique
- Exploiting structure in parallel implementation of interior point methods for optimization
- Primal convergence from dual subgradient methods for convex optimization
- On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
- Dantzig-Wolfe decomposition and branch-and-price solving in G12
- On parallelizing dual decomposition in stochastic integer programming
- Comparison of bundle and classical column generation
- Distributed Optimization With Local Domains: Applications in MPC and Network Flows
- Optimal Parameter Selection for the Alternating Direction Method of Multipliers (ADMM): Quadratic Problems
- A Polyhedral Approximation Framework for Convex and Robust Distributed Optimization
- Decomposition Principle for Linear Programs
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- First-Order Methods in Optimization
- Distributed Subgradient Methods for Multi-Agent Optimization
- Constrained Consensus and Optimization in Multi-Agent Networks
- Privacy-Preserving Distributed Optimization via Subspace Perturbation: A General Framework
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- Selected Topics in Column Generation
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
