We study multi-agent systems by considering the particular case of a system of linear equations. We propose to use the gradient method with penalty functions and present the numerical results of testing this method.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Khan, G. Pandurangan, and V. Kumar, “Distributed algorithms for constructing approximate minimum spanning trees in wireless sensor networks,” IEEE Trans. Paral. Distrib. Syst. 20, No. 1, 124–139 (2009).
I. Lobel, A. Ozdaglar, and D. Feijer, “Distributed multi-agent optimization with statedependent communication,” Math. Program. 129, No. 2, 255–284 (2011).
G. Scutari et al., “Decomposition by partial linearization: parallel optimization of multiagent systems,” IEEE Trans. Signal Process 62, No. 3, 641–656 (2014).
I. V. Konnov “Decentralized multi-agent optimization based on a penalty method,” Optimization (2021). https://doi.org/10.1080/02331934.2021.1950151.
Author information
Authors and Affiliations
Corresponding author
Additional information
JMS Source Journal International Mathematical Schools. Vol. 1. Advances in Pure and Applied Mathematics
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Konnov, I.V., Kashuba, A.Y. On the Gradient Method for Solving Multi-Agent Systems. J Math Sci 267, 487–493 (2022). https://doi.org/10.1007/s10958-022-06158-3
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-022-06158-3