An adaptive penalty-like continuous-time algorithm to constrained distributed convex optimization. Issue 8 (May 2022)

• Record Type: Journal Article
• Authors: Jia, Wenwen; Qin, Sitian
• Is Part Of: Journal of the Franklin Institute. Volume 359:Issue 8(2022)
• Page Start: 3692
• Page End: 3716
• Publication Date: 2022-05
• Subjects: Science -- Periodicals; Technology -- Periodicals; Patents -- United States -- Periodicals; 505
• DOI: 10.1016/j.jfranklin.2022.03.046
• Languages: English
• ISSNs: 0016-0032

Abstract

Abstract: This paper considers a nonsmooth constrained distributed convex optimization over multi-agent systems. Each agent in the multi-agent system only has access to the information of its objective function and constraint, and cooperatively minimizes the global objective function, which is composed of the sum of local objective functions. A novel continuous-time algorithm is proposed to solve the distributed optimization problem and effectively characterize the appropriate gain of the penalty function. It should be noted that the proposed algorithm is based on an adaptive strategy to avoid introducing the primal-dual variables and estimating the related exact penalty parameters. Additional, it is demonstrated that the state solution of the proposed algorithm achieves consensus and converges to an optimal solution of the optimization problem. Finally, numerical simulations are given and the proposed algorithm is applied to solve the optimal placement problem and energy consumption problem.