The best interpolation problem with nonzero lower bounds solved by a semismooth Newton algorithm (Q3596516)
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 5185616
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The best interpolation problem with nonzero lower bounds solved by a semismooth Newton algorithm |
scientific article; zbMATH DE number 5185616 |
Statements
31 August 2007
0 references
generalized Newton method
0 references
semismoothness
0 references
best interpolation
0 references
convex interpolation
0 references
algorithm
0 references
superlinear convergence
0 references
0.8639854192733765
0 references
0.8639854192733765
0 references
0.8257225155830383
0 references
0.8192298412322998
0 references
0.8161230087280273
0 references
