Riemannian Proximal Gradient Methods II: The Riemannian Proximal Gradient Method Converges at Rate O(1/k) under Retraction ConvexityResearch Paper
Many problems in statistics, signal processing and machine learning minimize a smooth loss plus a nonsmooth regularizer over a set with manifold structure: sparse principal component analysis over the Stiefel manifold, sparse blind deconvolution over the sphere, and clustering and dictionary-learning models with orthogonality constraints. In Euclidean space…