Convex spline interpolants with minimal curvature (Q1058257): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: On the solution of large, structured linear complementarity problems: The tridiagonal case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determination of shape preserving spline interpolants with minimal curvature via dual programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3928936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3049739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex cubic Hermite-spline interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform approximation by some Hermite interpolating splines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone and Convex Spline Interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spezielle rationale Splinefunktionen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schwach verkoppelte Ungleichungssysteme und konvexe Spline-Interpolation / rank
 
Normal rank
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
    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