An efficient algorithm for generating univariate cubic L₁ splines

DOI10.1023/B:COAP.0000042031.03626.1BzbMATH Open1069.65010OpenAlexW2044839389MaRDI QIDQ702483FDOQ702483

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

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

Recommendations

• Univariate cubic \(L_1\) splines -- a geometric programming approach
• A compressed primal-dual method for generating bivariate cubic \(L_{1}\) splines
• A geometric programming approach for bivariate cubic \(L_{1}\) splines
• Univariate cubic \(L _{1}\) interpolating splines based on the first derivative and on 5-point windows: analysis, algorithm and shape-preserving properties
• A geometric programming framework for univariate cubic \(L_1\) smoothing splines

zbMATH Keywords

stabilityconvex programmingcubic splinescomputational efficiencygeometric programmingiterationsactive set methodprimal affine algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical computation using splines (65D07) Spline approximation (41A15)

Cited In (11)

• A POLYNOMIAL ALGORITHM ON COMPUTING LAG SPLINE
• Univariate cubic \(L _{1}\) interpolating splines based on the first derivative and on 5-point windows: analysis, algorithm and shape-preserving properties
• 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
• A geometric programming framework for univariate cubic \(L_1\) smoothing splines
• \(L_1C^1\) polynomial spline approximation algorithms for large data sets
• Geometric dual formulation for first-derivative-based univariate cubic \(L_{1}\) splines
• A geometric programming approach for bivariate cubic \(L_{1}\) splines

This page was built for publication: An efficient algorithm for generating univariate cubic \(L_1\) splines

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