A distributed optimization approach via symmetric group actions under time-varying communication networks
From MaRDI portal
Publication:6131471
DOI10.1016/j.sysconle.2023.105681OpenAlexW4388861718MaRDI QIDQ6131471
Publication date: 5 April 2024
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sysconle.2023.105681
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A decomposition method for large scale MILPs, with performance guarantees and a power system application
- The zero-one knapsack problem with equality constraint
- Optimal distributed task scheduling in volunteer clouds
- Dual decomposition for multi-agent distributed optimization with coupling constraints
- Embedding equality constraints of optimization problems into a quantum annealer
- Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint
- Distributed Optimization Over Time-Varying Directed Graphs
- Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming
- Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem
- Distributed Primal Decomposition for Large-Scale MILPs
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- A Criterion for Exponential Consensus of Time-Varying Non-Monotone Nonlinear Networks
This page was built for publication: A distributed optimization approach via symmetric group actions under time-varying communication networks