Constrained optimization in \(L_{\infty}\)-norm: An algorithm for convex quadratic interpolation (Q2640311)
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 4186983
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constrained optimization in \(L_{\infty}\)-norm: An algorithm for convex quadratic interpolation |
scientific article; zbMATH DE number 4186983 |
Statements
Constrained optimization in \(L_{\infty}\)-norm: An algorithm for convex quadratic interpolation (English)
0 references
1991
0 references
The author gives an algorithm to determine min \(\| f^{(2)}\|_{\infty}\) where f interpolates the given points \(\{(x_ i,y_ i)\}^ p_{i=1}\) with increasing \(x_ i's\), \(f\in C^ 1\), f is absolutely continuous, \(f^{(2)}\in L_{\infty}[x_ 1,x_ p]\) and f is convex.
0 references
constrained optimization
0 references
convex quadratic interpolation
0 references
0 references
0 references
0 references
0 references
0.835891842842102
0 references
0.8157927393913269
0 references
0.8099076151847839
0 references
0.7989778518676758
0 references
