Convex spline interpolants with minimal curvature (Q1058257): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02260507 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W134033654 / rank | |||
Normal rank | |||
Latest revision as of 09:56, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convex spline interpolants with minimal curvature |
scientific article |
Statements
Convex spline interpolants with minimal curvature (English)
0 references
1985
0 references
The problem of finding convex spline interpolants with minimal mean curvature leads to a quadratic optimization problem of special structure. In the present note a corresponding dual problem without constraints is derived. Its objective function is piecewise quadratic and therefore admits an effective numerical treatment.
0 references
quadratic programming
0 references
dual optimization problem
0 references
tridiagonal Hessian
0 references
Newton's method
0 references
convex spline interpolants
0 references
minimal mean curvature
0 references
0 references
0 references
