Finite-rank kernel realization and completion
From MaRDI portal
Vector spaces, linear dependence, rank, lineability (15A03) Matrix completion problems (15A83) Positive matrices and their generalizations; cones of matrices (15B48) Hilbert spaces with reproducing kernels (= (proper) functional Hilbert spaces, including de Branges-Rovnyak and other structured spaces) (46E22)
Cites work
- A new graph parameter related to bounded rank positive semidefinite matrix completions
- Complexity of the positive semidefinite matrix completion problem with a rank constraint
- Composition in reproducing Kernel Hilbert spaces \textit{à rebours}
- Conditionally positive definite kernels in Hilbert \(C^*\)-modules
- Determinantal formulae for matrix completions associated with chordal graphs
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Extending positive definiteness
- scientific article; zbMATH DE number 3877491 (Why is no real title available?)
- scientific article; zbMATH DE number 4158856 (Why is no real title available?)
- scientific article; zbMATH DE number 1419176 (Why is no real title available?)
- Kernel methods in machine learning
- Kolmogorov decomposition of conditionally completely positive definite kernels
- Low-rank optimization on the cone of positive semidefinite matrices
- Matrices with high completely positive semidefinite rank
- Matrix completions, moments, and sums of Hermitian squares
- Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry
- On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
- Positive definite completions of partial Hermitian matrices
- Positive definite kernels and Hilbert C*-modules
- Positive semidefinite completions of partial Hermitian matrices
- Probability error bounds for approximation of functions in reproducing kernel Hilbert spaces
- Riesz-haviland criterion for incomplete data
- Sparsity Patterns with High Rank Extremal Positive Semidefinite Matrices
- The completion of covariance kernels
- The positive-definite completion problem
- The real positive definite completion problem for a simple cycle
- Theory of Reproducing Kernels
- UNITARY PROPAGATION OF OPERATOR DATA
This page was built for publication: Finite-rank kernel realization and completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7364833)