15-08-2019 | Original Paper | Issue 3/2020
Generation of point sets by convex optimization for interpolation in reproducing kernel Hilbert spaces
- Journal:
- Numerical Algorithms > Issue 3/2020
Important notes
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Abstract
We propose algorithms to take point sets for kernel-based interpolation of functions in reproducing kernel Hilbert spaces (RKHSs) by convex optimization. We consider the case of kernels with the Mercer expansion and propose an algorithm by deriving a second-order cone programming (SOCP) problem that yields n points at one sitting for a given integer n. In addition, by modifying the SOCP problem slightly, we propose another sequential algorithm that adds an arbitrary number of new points in each step. Numerical experiments show that in several cases the proposed algorithms compete with the P-greedy algorithm, which is known to provide nearly optimal points.
