Back to Search
Start Over
Approximation Conjugate Gradient Method for Low-Rank Matrix Recovery.
- Source :
- Symmetry (20738994); May2024, Vol. 16 Issue 5, p547, 17p
- Publication Year :
- 2024
-
Abstract
- Large-scale symmetric and asymmetric matrices have emerged in predicting the relationship between genes and diseases. The emergence of large-scale matrices increases the computational complexity of the problem. Therefore, using low-rank matrices instead of original symmetric and asymmetric matrices can greatly reduce computational complexity. In this paper, we propose an approximation conjugate gradient method for solving the low-rank matrix recovery problem, i.e., the low-rank matrix is obtained to replace the original symmetric and asymmetric matrices such that the approximation error is the smallest. The conjugate gradient search direction is given through matrix addition and matrix multiplication. The new conjugate gradient update parameter is given by the F-norm of matrix and the trace inner product of matrices. The conjugate gradient generated by the algorithm avoids SVD decomposition. The backtracking linear search is used so that the approximation conjugate gradient direction is computed only once, which ensures that the objective function decreases monotonically. The global convergence and local superlinear convergence of the algorithm are given. The numerical results are reported and show the effectiveness of the algorithm. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 20738994
- Volume :
- 16
- Issue :
- 5
- Database :
- Complementary Index
- Journal :
- Symmetry (20738994)
- Publication Type :
- Academic Journal
- Accession number :
- 177490467
- Full Text :
- https://doi.org/10.3390/sym16050547