Premium
Distributed continuous‐time algorithm for a general nonsmooth monotropic optimization problem
Author(s) -
Li Xiuxian,
Xie Lihua,
Hong Yiguang
Publication year - 2019
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/rnc.4547
Subject(s) - subgradient method , mathematical optimization , differentiable function , constraint (computer aided design) , optimization problem , function (biology) , computer science , mathematics , algorithm , mathematical analysis , geometry , evolutionary biology , biology
Summary This paper investigates a general monotropic optimization problem for continuous‐time networks, where the global objective function is a sum of local objective functions that are only known to individual agent, and general constraints are taken into account, including local inequality constraints, global equality constraint, and local feasible constraints. In addition, all functions involved in the objective functions and inequality constraints are not necessarily differentiable. To solve the problem, a distributed continuous‐time algorithm is designed using subgradient projections, and it is shown that the proposed algorithm is well defined in the sense that the existence of its solutions can be guaranteed. Furthermore, it is proved that the algorithm converges to an optimal solution for the general monotropic optimization problem. Finally, a simulation example is provided for validating the theoretical result.