On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices.
Alice CortinovisDaniel KressnerStefano MasseiPublished in: CoRR (2019)
Keyphrases
- semidefinite
- positive semidefinite
- linear complementarity problem
- semidefinite programming
- convex sets
- sufficient conditions
- data matrix
- higher dimensional
- complementarity problems
- approximation algorithms
- interior point methods
- singular value decomposition
- convex relaxation
- finite number
- convex optimization
- kernel methods
- training samples
- least squares
- polynomial kernels
- feature space
- objective function