An O(n) algorithm for discrete n-point convex approximation with applications to continuous case (Q1132491)
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: An O(n) algorithm for discrete n-point convex approximation with applications to continuous case |
scientific article; zbMATH DE number 3653407
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(n) algorithm for discrete n-point convex approximation with applications to continuous case |
scientific article; zbMATH DE number 3653407 |
Statements
An O(n) algorithm for discrete n-point convex approximation with applications to continuous case (English)
0 references
1979
0 references
best convex approximation
0 references
greatest convex minorant
0 references
linear programming
0 references
best monotone approximation
0 references
algorithm
0 references
