A truncation algorithm for minimizing the Frobenius-Schatten norm to find a sparse matrix
From MaRDI portal
Publication:1792415
DOI10.1134/S1064230718030097zbMath1415.90094OpenAlexW2808969131WikidataQ129579620 ScholiaQ129579620MaRDI QIDQ1792415
I. I. Moroz, I. A. Matveev, Li-ping Wang
Publication date: 11 October 2018
Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064230718030097
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Uses Software
Cites Work
- A unified algorithm for mixed \(l_{2,p}\)-minimizations and its application in feature selection
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
- Comparison of Discrimination Methods for the Classification of Tumors Using Gene Expression Data
- Sparse Reconstruction by Separable Approximation
- L 1/2 regularization
- Visual Classification With Multitask Joint Sparse Representation
This page was built for publication: A truncation algorithm for minimizing the Frobenius-Schatten norm to find a sparse matrix
