Constrained optimization in \(L_{\infty}\)-norm: An algorithm for convex quadratic interpolation
From MaRDI portal
Publication:2640311
DOI10.1016/0022-247X(91)90036-YzbMath0719.65007OpenAlexW2094241350MaRDI QIDQ2640311
Publication date: 1991
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(91)90036-y
Numerical mathematical programming methods (65K05) Numerical interpolation (65D05) Interpolation in approximation theory (41A05) Approximation with constraints (41A29)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A direct algorithm for optimal quadratic splines
- A computable convex programming characterization of optimal interpolatory quadratic splines with free knots
- An algorithm for computing constrained smoothing spline functions
- Isotonic, convex and related splines
- Error analysis for convex separable programs: Bounds on optimal and dual optimal solutions
- Perfect spline solutions to \(L^\infty\) extremal problems
- The perfect B-splines and a time-optimal control problem
- An approach to nonlinear programming
- Prolongement extremal de fonctions différentiables d'une variable
- Optimal Interpolation with Convex Splines of Second Degree
- Interpolation Properties of Generalized Perfect Splines and the Solutions of Certain Extremal Problems. I
- Error Analysis for Convex Separable Programs: The Piecewise Linear Approximation and The Bounds on The Optimal Objective Value
- A remark concerning perfect splines
- The Existence, Characterization and Essential Uniqueness of Solutions of L ∞ Extremal Problems
- Minimization Problems and Linear and Nonlinear Spline Functions. I: Existence
- Some variational problems on certain Sobolev spaces and perfect splines
This page was built for publication: Constrained optimization in \(L_{\infty}\)-norm: An algorithm for convex quadratic interpolation
