For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Distributed Proximal Minimization Algorithm for Constrained Convex Optimization over Strongly Connected Networks
Naoki HAYASHI Masaaki NAGAHARA
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2019/02/01
Online ISSN: 1745-1337
Type of Manuscript: Special Section PAPER (Special Section on Mathematical Systems Science and its Applications)
distributed optimization, proximal minimization algorithm, cooperative control, multi-agent system,
Full Text: PDF(994.4KB)
>>Buy this Article
This paper proposes a novel distributed proximal minimization algorithm for constrained optimization problems over fixed strongly connected networks. At each iteration, each agent updates its own state by evaluating a proximal operator of its objective function under a constraint set and compensating the unbalancing due to unidirectional communications. We show that the states of all agents asymptotically converge to one of the optimal solutions. Numerical results are shown to confirm the validity of the proposed method.