Convex spline interpolants with minimal curvature (Q1058257)

From MaRDI portal
Revision as of 09:56, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references