Networked Systems Theory: Distributed Algorithms for Optimal Cooperation of Dynamical Systems
From MaRDI portal
Publication:5154450
DOI10.1007/978-3-030-35032-1_3zbMath1471.93124OpenAlexW3011555275MaRDI QIDQ5154450
Publication date: 5 October 2021
Published in: Analytics for the Sharing Economy: Mathematics, Engineering and Business Perspectives (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-35032-1_3
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A distributed simplex algorithm for degenerate linear programs and multi-agent assignments
- A Polyhedral Approximation Framework for Convex and Robust Distributed Optimization
- Distributed Optimization and Games: A Tutorial Overview
- Distributed Optimization-Based Control of Multi-Agent Networks in Complex Environments
- Constrained Consensus and Optimization in Multi-Agent Networks
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Distributed Abstract Optimization via Constraints Consensus: Theory and Applications
- On Distributed Convex Optimization Under Inequality and Equality Constraints
This page was built for publication: Networked Systems Theory: Distributed Algorithms for Optimal Cooperation of Dynamical Systems