KDKaixin Du
Kaixin Du
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Kaixin Du has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Keyou You
Tsinghua University
1 shared publication - Min Meng
Tongji University
1 shared publication - Xiuxian Li
Tongji University
1 shared publication
Latest Publications
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 56 (7) , 3677-3688
Nonconvex Distributed Composite Optimization With Coupled Inequality Constraints
This article focuses on nonconvex distributed composite optimization over time-varying multiagent networks, where each agent possesses a local objective function, composed of a nonconvex and smooth function plus a nonsmooth function. The network aims to minimize the sum of all local functions subject to local set constraints and global nonconvex coupled inequality constraints. The inherent nonconvex and nonlinear characteristics of the objective and constraint functions pose formidable challenges in developing efficient distributed algorithms with convergence guarantees. To tackle this intricate problem, a novel distributed linearized augmented primal-dual algorithm is designed by incorporating distributed tracking and dynamic consensus techniques. It is theoretically shown that, with appropriately chosen parameters, the proposed algorithm can find an $\epsilon $ -Karush-Kuhn-Tucker (KKT) point. Specifically, the sequences of average optimality, constraint violation, and complementary slackness measure converge to zero at sublinear rates. Finally, a numerical application is presented to validate the effectiveness of the proposed algorithm.- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 56 (7) , 3677-3688
Nonconvex Distributed Composite Optimization With Coupled Inequality Constraints
This article focuses on nonconvex distributed composite optimization over time-varying multiagent networks, where each agent possesses a local objective function, composed of a nonconvex and smooth function plus a nonsmooth function. The network aims to minimize the sum of all local functions subject to local set constraints and global nonconvex coupled inequality constraints. The inherent nonconvex and nonlinear characteristics of the objective and constraint functions pose formidable challenges in developing efficient distributed algorithms with convergence guarantees. To tackle this intricate problem, a novel distributed linearized augmented primal-dual algorithm is designed by incorporating distributed tracking and dynamic consensus techniques. It is theoretically shown that, with appropriately chosen parameters, the proposed algorithm can find an $\epsilon $ -Karush-Kuhn-Tucker (KKT) point. Specifically, the sequences of average optimality, constraint violation, and complementary slackness measure converge to zero at sublinear rates. Finally, a numerical application is presented to validate the effectiveness of the proposed algorithm.