no code implementations • 29 Mar 2023 • Ting Tao, Ruyu Liu, Shaohua Pan
For this class of nonconvex and nonsmooth problems, we propose an inexact linearized proximal algorithm (iLPA) by computing in each step an inexact minimizer of a strongly convex majorization constructed with a partial linearization of their objective functions at the current iterate, and establish the convergence of the generated iterate sequence under the Kurdyka-\L\"ojasiewicz (KL) property of a potential function.
no code implementations • 24 Aug 2020 • Ting Tao, Yitian Qian, Shaohua Pan
This paper is concerned with the column $\ell_{2, 0}$-regularized factorization model of low-rank matrix recovery problems and its computation.
no code implementations • 11 Nov 2019 • Ting Tao, Shaohua Pan, Shujun Bi
This paper is concerned with the squared F(robenius)-norm regularized factorization form for noisy low-rank matrix recovery problems.
no code implementations • 24 Aug 2019 • Shujun Bi, Ting Tao, Shaohua Pan
To cater for the scenario in which only a coarse estimation is available for the rank of the true matrix, an $\ell_{2, 0}$-norm regularized term is added to the factored loss function to reduce the rank adaptively; and account for the ambiguities in the factorization, a balanced term is then introduced.