A Truncation Algorithm for Minimizing the Frobenius-Schatten Norm to Find a Sparse Matrix
- Authors: Wang L.P.1, Matveev I.A.1, Moroz I.I.2
-
Affiliations:
- Nanjing University of Aeronautics and Astronautics
- Federal Research Center for Computer Science and Control
- Issue: Vol 57, No 3 (2018)
- Pages: 434-442
- Section: Systems Analysis and Operations Research
- URL: https://journals.rcsi.science/1064-2307/article/view/220128
- DOI: https://doi.org/10.1134/S1064230718030097
- ID: 220128
Cite item
Abstract
A problem of optimizing a matrix sparse in the joint Frobenius-Schatten norm is considered. The least rows are proposed to be truncated according to the lower bound to fight the ill-conditionality of the matrix. Truncation not only helps avoid incorrect termination of the algorithm but it also reduces the computational complexity. Convergence analysis ensures that a truncation algorithm finds an approximate solution to the problem. The numerical experiments show the advantage of the truncation method over the previous algorithm.
About the authors
L. P. Wang
Nanjing University of Aeronautics and Astronautics
Author for correspondence.
Email: wlpmath@nuaa.edu.cn
China, Nanjing, 210016
I. A. Matveev
Nanjing University of Aeronautics and Astronautics
Email: wlpmath@nuaa.edu.cn
China, Nanjing, 210016
I. I. Moroz
Federal Research Center for Computer Science and Control
Email: wlpmath@nuaa.edu.cn
Russian Federation, Moscow, 119333
![](/img/style/loading.gif)