arXiv (OAI Expanded)
open access
Convergence Analysis of Distributed Optimization: A Dissipativity Framework
We develop a system-theoretic framework for the structured analysis of distributed optimization algorithms with decomposable cost functions. We model such algorithms as a network of interacting dynamical systems and derive tests for convergence based on incremental dissipativity and contraction theo
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Online Optimization with Unknown Time-Varying Parameters Using Noisy Gradient Measurements#1130559
- Decentralized Optimization over Time-Varying Row-Stochastic Digraphs#1142601
- Adaptive Management of Microservices in Dynamic Computing Environments: A Taxonomy and Future Directions#141459
- The Romero Law of Relational Stability (RZS): A Closed-Form Statement, Cross-Domain Operationalization, and Computational Verification#113245
- Goal Staying Makes Sum-of-Costs Anonymous Multi-Agent Path Finding NP-Hard#792908
Record · ID 1084072
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive