Abstract
In this paper we construct a hierarchy of multivariate polynomial approximation kernels for uniformly continuous functions on the hypercube via semidefinite programming. We give details on the implementation of the semidefinite programs defining the kernels. Finally, we show how symmetry reduction may be performed to increase numerical tractability.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
