# Strictly Low Rank Constraint Optimization -- An Asymptotically O(frac1t2) Method

arXiv: https://arxiv.org/abs/2307.14344 · HTML: https://mlsanity.com/paper/2307.14344/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 0 of its 14 references that are in the map.
- First posted on arXiv 4 Jul 2023.

## Abstract (arXiv)

We study a class of non-convex and non-smooth problems with textitrank regularization to promote sparsity in optimal solution. We propose to apply the proximal gradient descent method to solve the problem and accelerate the process with a novel support set projection operation on the singular values of the intermediate update. We show that our algorithms are able to achieve a convergence rate of O(frac1t2), which is exactly same as Nesterov's optimal convergence rate for first-order methods on smooth and convex problems. Strict sparsity can be expected and the support set of singular values during each update is monotonically shrinking, which to our best knowledge, is novel in momentum-based algorithms.