A direct algorithm for optimal quadratic splines
From MaRDI portal
The author develops an algorithm to find the minimal value k of \(\| f^{(2)}\|_{\infty}\), where f is a quadratic \(C^ 1\)-spline- interpolant of fixed data with free knots. Given the solution k, it is shown how to construct an optimal spline. A numerical example is given.
Recommendations
Cites work
- A computable convex programming characterization of optimal interpolatory quadratic splines with free knots
- A remark concerning perfect splines
- An Algorithm for Computing a Shape-Preserving Osculatory Quadratic Spline
- An algorithm for computing constrained smoothing spline functions
- Error analysis for convex separable programs: Bounds on optimal and dual optimal solutions
- Error Analysis for Convex Separable Programs: The Piecewise Linear Approximation and The Bounds on The Optimal Objective Value
- scientific article; zbMATH DE number 3179593 (Why is no real title available?)
- scientific article; zbMATH DE number 3748742 (Why is no real title available?)
- scientific article; zbMATH DE number 3497277 (Why is no real title available?)
- scientific article; zbMATH DE number 3562783 (Why is no real title available?)
- scientific article; zbMATH DE number 3283207 (Why is no real title available?)
- Interpolation by quadratic splines
- Interpolation Properties of Generalized Perfect Splines and the Solutions of Certain Extremal Problems. I
- Lempert mappings and symplectic forms
- Nonlinear programming codes. Information, tests, performance
- Note—A Note on Least Squares Fitting of Functions Constrained to be Either Nonnegative, Nondecreasing or Convex
- Optimal Interpolation with Convex Splines of Second Degree
- Perfect spline solutions to \(L^\infty\) extremal problems
- Periodic quadratic spline interpolant of minimal norm
- Quadratic interpolatory splines
- Quadratic spline interpolation
- Quadratic splines
- Some variational problems on certain Sobolev spaces and perfect splines
- Sur l'interpolation
- Technical Note—On the Estimation of Convex Functions
- The Existence, Characterization and Essential Uniqueness of Solutions of L ∞ Extremal Problems
- The perfect B-splines and a time-optimal control problem
- The Status of Nonlinear Programming Software
Cited in
(8)- A computable convex programming characterization of optimal interpolatory quadratic splines with free knots
- Constrained optimization in \(L_{\infty}\)-norm: An algorithm for convex quadratic interpolation
- Algorithms for optimal spline interpolation
- GAM spline algorithms: a direct comparison
- scientific article; zbMATH DE number 5673682 (Why is no real title available?)
- scientific article; zbMATH DE number 4135284 (Why is no real title available?)
- scientific article; zbMATH DE number 4098599 (Why is no real title available?)
- scientific article; zbMATH DE number 1126856 (Why is no real title available?)
This page was built for publication: A direct algorithm for optimal quadratic splines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q913438)
