Beyond symmetry: best submatrix selection for the sparse truncated SVD
From MaRDI portal
Publication:6634519
DOI10.1007/s10107-023-02030-7MaRDI QIDQ6634519
Publication date: 7 November 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
branch-and-cut algorithmapproximation algorithmsmixed-integer semidefinite programrow-sparse PCAsparse truncated SVD
Semidefinite programming (90C22) Mixed integer programming (90C11) Combinatorial optimization (90C27)
This page was built for publication: Beyond symmetry: best submatrix selection for the sparse truncated SVD