A computable convex programming characterization of optimal interpolatory quadratic splines with free knots

DOI10.1016/0022-247X(86)90082-XzbMath0598.65044OpenAlexW2020723810MaRDI QIDQ1079925

Lakshman S. Thakur

Publication date: 1986

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(86)90082-x

zbMATH Keywords

convex optimizationnumerical examplesminimizationperfect splineoptimal spline

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items

Constrained optimization in \(L_{\infty}\)-norm: An algorithm for convex quadratic interpolation, A direct algorithm for optimal quadratic splines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quadratic interpolatory splines
• Perfect spline solutions to \(L^\infty\) extremal problems
• Quadratic splines
• Periodic quadratic spline interpolant of minimal norm
• Uniqueness of solution in linear programming
• Interpolation by quadratic splines
• Prolongement extremal de fonctions différentiables d'une variable
• The Status of Nonlinear Programming Software
• 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
• Convergence Conditions for Nonlinear Programming Algorithms
• Some variational problems on certain Sobolev spaces and perfect splines
• Quadratic spline interpolation