arXiv (All)
open access
Low-Bit Distributed Constrained Optimization with Application to Optimal Scheduling and Allocation
and-cluster-computingdistributedmultiagent-systemsoptimization-and-controlparallelsystems-and-control
This paper proposes a distributed resource allocation algorithm in which each agent communicates only the sign of its local cost gradient, a single bit per directed link per iteration. The algorithm is based on Laplacian-gradient dynamics and preserves the equality (demand) constraint at every itera
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
- Low-Bit Distributed Constrained Optimization with Application to Optimal Scheduling and Allocation#1381212
- Convergence Analysis of Distributed Optimization: A Dissipativity Framework#1084072
- Volumetric path following algorithms for linear programming#429974
- Optimal Routing for Federated Learning over Dynamic Satellite Networks: Tractable or Not?#124022
- Multi-Agent Pathfinding Under Team-Connected Communication Constraint via Adaptive Path Expansion and Dynamic Leading#183185
Record · ID 1388997
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