# Computing minimal interpolants in $C^{1,1}(\mathbb R^d)$

### Ariel Herbert-Voss

Harvard University, Cambridge, USA### Matthew J. Hirn

Michigan State University, East Lansing, USA### Frederick McCollum

New York University, USA

## Abstract

We consider the following interpolation problem. Suppose one is given a finite set $E \subset \mathbb R^d$, a function $f \colon E \to \mathbb R$, and possibly the gradients of $f$ at the points of $E$. We want to interpolate the given information with a function $F \in C^{1,1}(\mathbb R^d)$ with the minimum possible value of Lip$(\nabla F)$. We present practical, efficient algorithms for constructing an $F$ such that Lip$(\nabla F)$ is minimal, or for less computational effort, within a small dimensionless constant of being minimal.

## Cite this article

Ariel Herbert-Voss, Matthew J. Hirn, Frederick McCollum, Computing minimal interpolants in $C^{1,1}(\mathbb R^d)$. Rev. Mat. Iberoam. 33 (2017), no. 1, pp. 29–66

DOI 10.4171/RMI/927