Dual consensus proximal algorithm for multi-agent sharing problems

DOI10.1109/TSP.2021.3114978MaRDI QIDQ6600129zbMATH OpenFDO

Authors Sulaiman A. Alghunaim, Qi Lyu, Ming Yan, Ali H. Sayed

Publication date 9 September 2024

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSP.2021.3114978

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Multi-agent systems (93A16) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(3)

• A linearly convergent distributed heavy-ball GNE seeking algorithm for aggregative games over weight-unbalanced digraphs via finite-time consensus
• Linear convergence for distributed stochastic optimization with coupled inequality constraints
• Distributed aggregative optimization with affine coupling constraints

This page was built for publication: Dual consensus proximal algorithm for multi-agent sharing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6600129)