Distributed Nonsmooth Constrained Optimization Algorithm under Weight-unbalanced Directed Graph
This paper studies a class of distributed nonsmooth constrained optimization problem under weight-unbalanced directed communication network, which contains the local set constraints and the global coupled nonlinear inequality constraints. Moreover, the involved functions in the optimization problem are nonsmooth. To tackle the challenges caused by the unbalanced communication network and the nonsmooth functions, a novel distributed projection optimization algorithm, based on Moreau-Yosida approximate function and the distributed estimator, is proposed in this article. The effectiveness of our presented algorithm is verified by stability analysis and numerical simulations.
Authors
- Zhijun Guo (ORCID: https://orcid.org/0000-0001-8630-431X)
- Rui Gao (ORCID: https://orcid.org/0009-0004-1782-7642)
- Li Feng (ORCID: https://orcid.org/0000-0002-6404-1130)
- Lingwei Zeng (ORCID: https://orcid.org/0000-0002-4692-1222)
Institutions
- Chongqing University of Posts and Telecommunications (CN)
- Nanchang University (CN)
Publication Details
- Published
- 2025-05-23
- DOI
- https://doi.org/10.1109/icaisisas64483.2025.11051448
- Primary Topic
- Advanced Computing and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China
- Natural Science Foundation of Jiangxi Province
- Natural Science Foundation of Chongqing
- Innovation Fund