Constrained optimization in L_-norm: An algorithm for convex quadratic interpolation

From MaRDI portal





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.











This page was built for publication: Constrained optimization in \(L_{\infty}\)-norm: An algorithm for convex quadratic interpolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2640311)