arXiv Analytics

Sign in

arXiv:2303.10852 [math.OC]AbstractReferencesReviewsResources

Smoothing algorithms for nonsmooth and nonconvex minimization over the stiefel manifold

Jinlai ZHu, Jianfeng Huang, Lihua Yang, Qia Li

Published 2023-03-20Version 1

We consider a class of nonsmooth and nonconvex optimization problems over the Stiefel manifold where the objective function is the summation of a nonconvex smooth function and a nonsmooth Lipschitz continuous convex function composed with an linear mapping. We propose three numerical algorithms for solving this problem, by combining smoothing methods and some existing algorithms for smooth optimization over the Stiefel manifold. In particular, we approximate the aforementioned nonsmooth convex function by its Moreau envelope in our smoothing methods, and prove that the Moreau envelope has many favorable properties. Thanks to this and the scheme for updating the smoothing parameter, we show that any accumulation point of the solution sequence generated by the proposed algorithms is a stationary point of the original optimization problem. Numerical experiments on building graph Fourier basis are conducted to demonstrate the efficiency of the proposed algorithms.

Related articles: Most relevant | Search more
arXiv:2212.06410 [math.OC] (Published 2022-12-13)
Parameter-free accelerated gradient descent for nonconvex minimization
arXiv:2305.00091 [math.OC] (Published 2023-04-28)
A Theory of the NEPv Approach for Optimization On the Stiefel Manifold
arXiv:2409.01770 [math.OC] (Published 2024-09-03, updated 2025-05-15)
Randomized Submanifold Subgradient Method for Optimization over Stiefel Manifolds