Achieving Local Consensus Over Compact Submanifolds

• 成果类型: Article
• 署名作者: Hu, Jiang; Zhang, Jiaojiao; Deng, Kangkang
• 署名单位: University of California System; University of California Berkeley; Royal Institute of Technology; National University of Defense Technology - China
• 刊物名称: IEEE TRANSACTIONS ON AUTOMATIC CONTROL
• ISSN/ISSBN: 0018-9286
• DOI: 10.1109/TAC.2025.3545711
• 发表日期: 2025
• 页码: 5750-5763
• 关键词: Manifolds; CONVERGENCE; optimization; ELECTRONIC MAIL; training; Euclidean distance; Data mining; computational modeling; computational efficiency; vectors; Compact submanifold; consensus; linear convergence; local Lipschitz continuity; proximal smoothness

摘要

Decentralized optimization often relies on achieving consensus among disparate agents. This article addresses the consensus problem in decentralized networks, focusing on the challenges posed by a nonconvex compact submanifold constraint. We identify conditions on network topology that facilitate local linear convergence to global consensus, where the achieved linear rate matches that of the Euclidean setting. Central to our analysis are the convex-like properties, specifically proximal smoothness and the restricted secant inequality, which form the foundation of our theoretical framework. These results will be useful for the design and analysis of decentralized manifold optimization algorithms. Numerical experiments are conducted to validate our theoretical findings.