A Constraint Dissolving Approach for Nonsmooth Optimization over the Stiefel Manifold
Not on the map. Why?
Abstract (arXiv)
This paper focus on the minimization of a possibly nonsmooth objective function over the Stiefel manifold. The existing approaches either lack efficiency or can only tackle prox-friendly objective functions. We propose a constraint dissolving function named NCDF and show that it has the same first-order stationary points and local minimizers as the original problem in a neighborhood of the Stiefel manifold. Furthermore, we show that the Clarke subdifferential of NCDF is easy to achieve from the Clarke subdifferential of the objective function. Therefore, various existing approaches for unconstrained nonsmooth optimization can be directly applied to nonsmooth optimization problems over the Stiefel manifold. We propose a framework for developing subgradient-based methods and establish their convergence properties based on prior works. Furthermore, based on our proposed framework, we can develop efficient approaches for optimization over the Stiefel manifold. Preliminary numerical experiments further highlight that the proposed constraint dissolving approach yields efficient and direct implementations of various unconstrained approaches to nonsmooth optimization problems over the Stiefel manifold.
Key facts. Cited by 7 papers in the map (data through 13 Oct 2026). First posted on arXiv 21 May 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 3; 2024: 0; 2025: 2; 2026: 2.
7 papers.
- 2023Forward-backward Gaussian variational inference via JKO in the Bures-Wasserstein Spacecited by 36
- 2023Adam-family Methods with Decoupled Weight Decay in Deep Learningcited by 5
- 2023Stochastic Subgradient Methods with Guaranteed Global Stability in Nonsmooth Nonconvex Optimizationcited by 3
- 2026Primal-Dual Methods for Nonsmooth Nonconvex Optimization with Orthogonality Constraintscited by 1
- 2026Sliced Inner Product Gromov-Wasserstein Distancescited by 1
- 2025Enhancing Distributional Robustness in Principal Component Analysis by Wasserstein Distancescited by 0
- 2025Riemannian Geometric-based Meta Learningcited by 0
- 2026Sliced Inner Product Gromov-Wasserstein Distances8 May 2026
- 2026Primal-Dual Methods for Nonsmooth Nonconvex Optimization with Orthogonality Constraints5 Apr 2026
- 2025Riemannian Geometric-based Meta Learning14 Mar 2025
- 2025Enhancing Distributional Robustness in Principal Component Analysis by Wasserstein Distances4 Mar 2025
- 2023Adam-family Methods with Decoupled Weight Decay in Deep Learning13 Oct 2023
- 2023Stochastic Subgradient Methods with Guaranteed Global Stability in Nonsmooth Nonconvex Optimization19 Jul 2023
- 2023Forward-backward Gaussian variational inference via JKO in the Bures-Wasserstein Space10 Apr 2023