An efficient algorithm for generating univariate cubic L₁ splines

DOI10.1023/B:COAP.0000042031.03626.1BMaRDI QIDQ702483zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

active set methodcomputational efficiencyconvex programmingcubic splinesgeometric programmingiterationsprimal affine algorithmstability

Mathematics Subject Classification ID

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

Review text

The authors study an alternative to the discretization based primal affine algorithm. This algorithm is an active set algorithm based on the geometric programming (GP)framework. The GP model includes a pair of primal and dual problems and a dual-to-primal transformation. They show that the proposed active set algorithm yields an exact solution for a cubic \(L_1\)-spline in a finite number of iterations and that, in stability and computational efficiency, it outperforms the widely used discretization based primal affine algorithm.

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₁ smoothing splines

Cited in

(11)

• 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₁ smoothing splines
• Geometric dual formulation for first-derivative-based univariate cubic \(L_{1}\) splines
• A geometric programming approach for bivariate cubic \(L_{1}\) splines
• 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
• L₁C^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

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)