Constructing positive definite polynomials
From MaRDI portal
Recommendations
Cites work
- An extragradient approximation method for variational inequality problem on fixed point problem of nonexpensive mappings and monotone mappings
- An introduction to support vector machines and other kernel-based learning methods.
- Functions that preserve families of positive semidefinite matrices
- scientific article; zbMATH DE number 4191831 (Why is no real title available?)
- scientific article; zbMATH DE number 3477793 (Why is no real title available?)
- Kernel methods and machine learning
- Kernel-based approximation methods using MATLAB
- Matrix positivity preservers in fixed dimension. I
- Moment-sequence transforms
- Polynomials with nonnegative coefficients and a given factor
- Positive definite functions on spheres
- Positive definite matrices and absolutely monotonic functions
- Positive definite sequences and absolutely monotonic functions
- Preserving positivity for matrices with sparsity constraints
- Strictly positive definite functions on a real inner product space
- The Theory of Infinitely Divisible Matrices and Kernels
This page was built for publication: Constructing positive definite polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6052142)