A Novel Nonconvex Relaxation Approach to Low-Rank Matrix Completion of Inexact Observed Data
- 2 July 2024
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 34 (3) , 2378-2410
Abstract
In recent years, matrix completion has become one of the main concepts in data science. In the process of data acquisition in real applications, in addition to missing data, observed data may be inaccurate. This paper is concerned with such matrix completion of inexact observed data which can be modeled as a rank minimization problem. We adopt the difference of the nuclear norm and the Frobenius norm as an approximation of the rank function, employ Tikhonov-type regularization to preserve the inherent characteristics of original data and control oscillation arising from inexact observations, and then establish a new nonsmooth and nonconvex relaxation model for such low-rank matrix completion. We propose a new accelerated proximal gradient–type algorithm to solve the nonsmooth and nonconvex minimization problem and show that the generated sequence is bounded and globally converges to a critical point of our model. Furthermore, the rate of convergence is given via the Kurdyka–Łojasiewicz property. We evaluate our model and method on visual images and received signal strength fingerprint data in an indoor positioning system. Numerical experiments illustrate that our approach outperforms some state-of-the-art methods, and also verify the efficacy of the Tikhonov-type regularization.Keywords
Funding Information
- National Natural Science Foundation of China (12171271, 12271291)
This publication has 39 references indexed in Scilit:
- Calmness of partial perturbation to composite rank constraint systems and its applicationsJournal of Global Optimization, 2022
- Kurdyka–Łojasiewicz Exponent via Inf-projectionFoundations of Computational Mathematics, 2021
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo–Tseng error bound propertyMathematical Programming, 2018
- Calculus of the Exponent of Kurdyka–Łojasiewicz Inequality and Its Applications to Linear Convergence of First-Order MethodsFoundations of Computational Mathematics, 2017
- Fast L1–L2 Minimization via a Proximal OperatorJournal of Scientific Computing, 2017
- An Alternating Direction Method with Continuation for Nonconvex Low Rank MinimizationJournal of Scientific Computing, 2015
- Proximal alternating linearized minimization for nonconvex and nonsmooth problemsMathematical Programming, 2013
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methodsMathematical Programming, 2011
- Nonsmooth Analysis of Singular Values. Part I: TheorySet-Valued Analysis, 2005
- Shape and motion from image streams under orthography: a factorization methodInternational Journal of Computer Vision, 1992