<p>We consider the problem of decentralized nonconvex optimization over a compact submanifold, where each local agent’s objective function defined by the local dataset is smooth. Leveraging the powerful tool of proximal smoothness, we establish local linear convergence of the projected gradient descent method with a unit step size for solving the consensus problem over the nonconvex compact submanifold. This serves as the basis for designing and analyzing decentralized algorithms on manifolds. Subsequently, we propose two decentralized methods: the decentralized projected Riemannian gradient descent (DPRGD) and the decentralized projected Riemannian gradient tracking (DPRGT). We establish their convergence rates of <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="211_2025_1497_Article_IEq1.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="74" /> </InlineMediaObject> <EquationSource Format="TEX">$\mathcal {O}(1/\sqrt{K})$</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">O</mi> <mo stretchy="false">(</mo> <mn>1</mn> <mo stretchy="false">/</mo> <msqrt> <mi>K</mi> </msqrt> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="211_2025_1497_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="60" /> </InlineMediaObject> <EquationSource Format="TEX">$\mathcal {O}(1/K)$</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">O</mi> <mo stretchy="false">(</mo> <mn>1</mn> <mo stretchy="false">/</mo> <mi>K</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, respectively, to reach a stationary point. To the best of our knowledge, DPRGT is the first decentralized algorithm to achieve exact convergence for solving decentralized optimization over a compact submanifold. Beyond the linear convergence results on the consensus, two key tools developed in the proof are the Lipschitz-type inequality of the projection operator and the Riemannian quadratic upper bound for smooth functions on the compact submanifold, which could be of independent interest. Finally, we demonstrate the effectiveness of our proposed methods compared to state-of-the-art ones through numerical experiments on eigenvalue problems and low-rank matrix completion.</p>

Decentralized projected Riemannian gradient method for smooth optimization on compact submanifolds embedded in the Euclidean space

期刊论文
发表日期：

2025年10月3日

查看全文

Kangkang Deng,
Jiang Hu

摘要

We consider the problem of decentralized nonconvex optimization over a compact submanifold, where each local agent’s objective function defined by the local dataset is smooth. Leveraging the powerful tool of proximal smoothness, we establish local linear convergence of the projected gradient descent method with a unit step size for solving the consensus problem over the nonconvex compact submanifold. This serves as the basis for designing and analyzing decentralized algorithms on manifolds. Subsequently, we propose two decentralized methods: the decentralized projected Riemannian gradient descent (DPRGD) and the decentralized projected Riemannian gradient tracking (DPRGT). We establish their convergence rates of $\mathcal {O}(1/\sqrt{K})$ $O (1 / \sqrt{K})$ and $\mathcal {O}(1/K)$ $O (1 / K)$ , respectively, to reach a stationary point. To the best of our knowledge, DPRGT is the first decentralized algorithm to achieve exact convergence for solving decentralized optimization over a compact submanifold. Beyond the linear convergence results on the consensus, two key tools developed in the proof are the Lipschitz-type inequality of the projection operator and the Riemannian quadratic upper bound for smooth functions on the compact submanifold, which could be of independent interest. Finally, we demonstrate the effectiveness of our proposed methods compared to state-of-the-art ones through numerical experiments on eigenvalue problems and low-rank matrix completion.