Convexity preserving interpolation with exponential splines
Sufficient and necessary conditions are derived under which interpolating splines are convex if the data set is in convex position. In order to select one of the interpolants, by means of a well-known objective function a quadratic optimization problem is stated which can be solved effectively by passing to a dual program.
unconstrained dual program with tridiagonal Hessian
scientific article; zbMATH DE number 3929614