Finite termination of a dual Newton method for convex best \(C^1\) interpolation and smoothing (Q2570654)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finite termination of a dual Newton method for convex best \(C^1\) interpolation and smoothing |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finite termination of a dual Newton method for convex best \(C^1\) interpolation and smoothing |
scientific article |
Statements
Finite termination of a dual Newton method for convex best \(C^1\) interpolation and smoothing (English)
0 references
28 October 2005
0 references
The paper confirms theoretically the observed numerical effectiveness of the Newton method for solving the problems of convex best interpolation and smoothing in the space of cubic \(C^1\)-splines on a given partition. It is proved that the Newton method has the finite termination property under a mild condition, and that violation of this condition may cause the method to fail. The analysis relies on the estimation of the generalized Hessian.
0 references
convex interpolation
0 references
smoothing
0 references
cubic splines
0 references
Newton method
0 references
best interpolation
0 references
