dc.contributor.author |
Konnov I.V. |
|
dc.date.accessioned |
2022-02-09T20:33:21Z |
|
dc.date.available |
2022-02-09T20:33:21Z |
|
dc.date.issued |
2021 |
|
dc.identifier.issn |
0233-1934 |
|
dc.identifier.uri |
https://dspace.kpfu.ru/xmlui/handle/net/168979 |
|
dc.description.abstract |
We propose a decentralized penalty method for general convex constrained multi-agent optimization problems. Each auxiliary penalized problem is solved approximately with a special parallel descent splitting method. The method can be implemented in a computational network where each agent sends information only to the nearest neighbours. Convergence of the method is established under rather weak assumptions. We also describe a specialization of the proposed approach to the feasibility problem. |
|
dc.relation.ispartofseries |
Optimization |
|
dc.subject |
constrained multi-agent optimization |
|
dc.subject |
Convex optimization |
|
dc.subject |
decentralized penalty method |
|
dc.subject |
decomposition |
|
dc.subject |
descent splitting method |
|
dc.subject |
feasibility problem |
|
dc.title |
Decentralized multi-agent optimization based on a penalty method |
|
dc.type |
Article |
|
dc.collection |
Публикации сотрудников КФУ |
|
dc.source.id |
SCOPUS02331934-2021-SID85110253170 |
|