Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming
本文通过半定规划构造了一族多元多项式逼近核，给出了实现细节，并展示了如何利用对称性约化提高数值可解性。
In this paper we construct a hierarchy of multivariate polynomial approximation kernels via semidefinite programming. We give details on the implementation of the semidefinite programs defining the kernels. Finally, we show how a symmetry reduction may be performed to increase numerical tractability.