Yan Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yan Li has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Liping Zhang
Department of Mathematical Sciences, Tsinghua University, Beijing, China
3 shared publications - Defeng Sun
Department of Applied Mathematics, The Hong Kong Polytechnic University, Hong Kong, China
1 shared publication
Latest Publications
- 2 July 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 34 (3) , 2378-2410
A Novel Nonconvex Relaxation Approach to Low-Rank Matrix Completion of Inexact Observed Data
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.
- 2 July 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 34 (3) , 2378-2410
A Novel Nonconvex Relaxation Approach to Low-Rank Matrix Completion of Inexact Observed Data
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.
- Open Access
Unsupervised Feature Selection via Nonnegative Orthogonal Constrained Regularized Minimization
Unsupervised feature selection has drawn wide attention in the era of big data since it is a primary technique for dimensionality reduction. However, many existing unsupervised feature selection models and solution methods were presented for the purpose of application, and lack of theoretical support, e.g., without convergence analysis. In this paper, we first establish a novel unsupervised feature selection model based on regularized minimization with nonnegative orthogonal constraints, which has advantages of embedding feature selection into the nonnegative spectral clustering and preventing overfitting. An effective inexact augmented Lagrangian multiplier method is proposed to solve our model, which adopts the proximal alternating minimization method to solve subproblem at each iteration. We show that the sequence generated by our method globally converges to a Karush-Kuhn-Tucker point of our model. Extensive numerical experiments on popular datasets demonstrate the stability and robustness of our method. Moreover, comparison results of algorithm performance show that our method outperforms some existing state-of-the-art methods.
Open AccessUnsupervised Feature Selection via Nonnegative Orthogonal Constrained Regularized Minimization
Unsupervised feature selection has drawn wide attention in the era of big data since it is a primary technique for dimensionality reduction. However, many existing unsupervised feature selection models and solution methods were presented for the purpose of application, and lack of theoretical support, e.g., without convergence analysis. In this paper, we first establish a novel unsupervised feature selection model based on regularized minimization with nonnegative orthogonal constraints, which has advantages of embedding feature selection into the nonnegative spectral clustering and preventing overfitting. An effective inexact augmented Lagrangian multiplier method is proposed to solve our model, which adopts the proximal alternating minimization method to solve subproblem at each iteration. We show that the sequence generated by our method globally converges to a Karush-Kuhn-Tucker point of our model. Extensive numerical experiments on popular datasets demonstrate the stability and robustness of our method. Moreover, comparison results of algorithm performance show that our method outperforms some existing state-of-the-art methods.
- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 19 (3) , 2251-2267
A smoothing Newton method preserving nonnegativity for solving tensor complementarity problems with $ P_0 $ mappingsIn this paper, we prove that the tensor complementarity problem with the $ P_0 $ mapping on the $ n $-dimensional nonnegative orthant is solvable and the solution set is nonempty and compact under mild assumptions. Since the involved homogeneous polynomial is a $ P_0 $ mapping on the $ n $-dimensional nonnegative orthant, the existing smoothing Newton methods are not directly used to solve this problem. So, we propose a smoothing Newton method preserving nonnegativity via a new one-dimensional line search rule for solving such problem. The global convergence is established and preliminary numerical results illustrate that the proposed algorithm is efficient and very promising.- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 19 (3) , 2251-2267
A smoothing Newton method preserving nonnegativity for solving tensor complementarity problems with $ P_0 $ mappingsIn this paper, we prove that the tensor complementarity problem with the $ P_0 $ mapping on the $ n $-dimensional nonnegative orthant is solvable and the solution set is nonempty and compact under mild assumptions. Since the involved homogeneous polynomial is a $ P_0 $ mapping on the $ n $-dimensional nonnegative orthant, the existing smoothing Newton methods are not directly used to solve this problem. So, we propose a smoothing Newton method preserving nonnegativity via a new one-dimensional line search rule for solving such problem. The global convergence is established and preliminary numerical results illustrate that the proposed algorithm is efficient and very promising.