A distributed optimization approach via symmetric group actions under time-varying communication networks
From MaRDI portal
Publication:6131471
Cites work
- scientific article; zbMATH DE number 5294801 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- A Criterion for Exponential Consensus of Time-Varying Non-Monotone Nonlinear Networks
- A decomposition method for large scale MILPs, with performance guarantees and a power system application
- Convex optimization theory.
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint
- Distributed Optimization Over Time-Varying Directed Graphs
- Distributed Primal Decomposition for Large-Scale MILPs
- Dual decomposition for multi-agent distributed optimization with coupling constraints
- Duality gap estimation of linear equality constrained binary quadratic programming
- Embedding equality constraints of optimization problems into a quantum annealer
- Optimal distributed task scheduling in volunteer clouds
- The zero-one knapsack problem with equality constraint
- ``Outline of an algorithm for integer solutions to linear programs and ``An algorithm for the mixed integer problem
This page was built for publication: A distributed optimization approach via symmetric group actions under time-varying communication networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131471)
