mlsanityData to 7 Oct 2026

A Riemannian smoothing steepest descent method for non-Lipschitz optimization on submanifolds

arXiv 2104.04199 ↗First posted 9 Apr 2021math.OC cs.IT cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

In this paper, we propose a Riemannian smoothing steepest descent method to minimize a nonconvex and non-Lipschitz function on submanifolds. The generalized subdifferentials on Riemannian manifold and the Riemannian gradient sub-consistency are defined and discussed. We prove that any accumulation point of the sequence generated by the Riemannian smoothing steepest descent method is a stationary point associated with the smoothing function employed in the method, which is necessary for the local optimality of the original non-Lipschitz problem. Under the Riemannian gradient sub-consistency condition, we also prove that any accumulation point is a Riemannian limiting stationary point of the original non-Lipschitz problem. Numerical experiments are conducted to demonstrate the efficiency of the proposed method.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 13 of its 54 references that are in the map. First posted on arXiv 9 Apr 2021.

Builds on

13 of 54 references.

References · 13

  1. 2015Complete Dictionary Recovery over the Sphere I: Overview and the Geometric Picturecited by 49
  2. 2016A note on the sample complexity of the Er-SpUD algorithm by Spielman, Wang and Wright for exact recovery of sparsely used dictionariescited by 26
  3. 2015Dual Principal Component Pursuitcited by 19
  4. 2014Finding a sparse vector in a subspace: Linear sparsity using alternating directionscited by 18
  5. 2018Bilinear Factor Matrix Norm Minimization for Robust PCA: Algorithms and Applicationscited by 16
  6. 2020Finding the Sparsest Vectors in a Subspace: Theory, Algorithms, and Applicationscited by 13
  7. 2015MADMM: a generic algorithm for non-smooth optimization on manifoldscited by 12
  8. 2020A Manifold Proximal Linear Method for Sparse Spectral Clustering with Application to Single-Cell RNA Sequencing Data Analysiscited by 7
  9. 2020Manifold Proximal Point Algorithms for Dual Principal Component Pursuit and Orthogonal Dictionary Learningcited by 6
  10. 2021A Semismooth Newton based Augmented Lagrangian Method for Nonsmooth Optimization on Matrix Manifoldscited by 6
  11. 2020Riemannian Stochastic Proximal Gradient Methods for Nonsmooth Optimization over the Stiefel Manifoldcited by 5
  12. 2013Joint Power and Admission Control: Non-Convex Lq Approximation and An Effective Polynomial Time Deflation Approachcited by 1
1 more
  1. 2014Smoothing SQP methods for solving degenerate nonsmooth constrained optimization problems with applications to bilevel programscited by 1

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.