Convergence of Newton's method for convex best interpolation (Q5927645)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1580032
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence of Newton's method for convex best interpolation |
scientific article; zbMATH DE number 1580032 |
Statements
Convergence of Newton's method for convex best interpolation (English)
0 references
7 October 2001
0 references
The authors consider the following convex best interpolation problem: find a convex function which interpolates given points and has a minimal \(L^2\) norm of the second derivative. An extension of the Newton method, the so-called semismooth generalized Newton method of \textit{L. Qi} and \textit{J. Sun} [Math. Programming 58A, No. 3, 353-367 (1993; Zbl 0780.90090)] is analysed and its numerical efficiency is confirmed by numerical experiments.
0 references
interpolation by convex functions with constraints
0 references
convex best interpolations
0 references
semismooth generalized Newton method
0 references
numerical experiments
0 references
0.8714660406112671
0 references
0.8705666661262512
0 references
0.8639854192733765
0 references
0.8566526174545288
0 references
