A Riemannian ADMM

arXiv2211.02163MaRDI QIDQ6416115

Author name not available (Why is that?)

Publication date: 3 November 2022

Abstract: We consider a class of Riemannian optimization problems where the objective is the sum of a smooth function and a nonsmooth function, considered in the ambient space. This class of problems finds important applications in machine learning and statistics such as the sparse principal component analysis, sparse spectral clustering, and orthogonal dictionary learning. We propose a Riemannian alternating direction method of multipliers (ADMM) to solve this class of problems. Our algorithm adopts easily computable steps in each iteration. The iteration complexity of the proposed algorithm for obtaining an $epsilon$-stationary point is analyzed under mild assumptions. Existing ADMM for solving nonconvex problems either does not allow nonconvex constraint set, or does not allow nonsmooth objective function. In contrast, our complexity result is established for problems with simultaneous nonsmooth objective and manifold constraint. Numerical experiments are conducted to demonstrate the advantage of the proposed method.

Has companion code repository: https://github.com/JasonJiaxiangLi/RADMM

Mathematics Subject Classification ID

No records found.

This page was built for publication: A Riemannian ADMM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6416115)