Convex spline interpolants with minimal curvature (Q1058257)

From MaRDI portal
Revision as of 23:53, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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