An efficient algorithm for generating univariate cubic \(L_1\) splines

DOI10.1023/B:COAP.0000042031.03626.1bzbMath1069.65010MaRDI QIDQ702483

Hao Cheng, John E. Lavery, Shu-Cherng Fang

Publication date: 17 January 2005

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:coap.0000042031.03626.1b

zbMATH Keywords

stability; convex programming; cubic splines; computational efficiency; geometric programming; iterations; active set method; primal affine algorithm

Mathematics Subject Classification ID

65D07: Numerical computation using splines

65K05: Numerical mathematical programming methods

90C25: Convex programming

41A15: Spline approximation

Related Items

Univariate cubic \(L _{1}\) interpolating splines based on the first derivative and on 5-point windows: analysis, algorithm and shape-preserving properties, \(L_1C^1\) polynomial spline approximation algorithms for large data sets, Shape-preserving univariate cubic and higher-degree \(L_{1}\) splines with function-value-based and multistep minimization principles, Fast \(L_1^kC^k\) polynomial spline interpolation algorithm with shape-preserving properties, A compressed primal-dual method for generating bivariate cubic \(L_{1}\) splines, Univariate cubic \(L_1\) interpolating splines: analytical results for linearity, convexity and oscillation on 5-pointwindows, Univariate cubic \(L_1\) interpolating splines: spline functional, window size and analysis-based algorithm, Geometric dual formulation for first-derivative-based univariate cubic \(L_{1}\) splines, A geometric programming approach for bivariate cubic \(L_{1}\) splines