An efficient algorithm for generating univariate cubic \(L_1\) splines (Q702483): Difference between revisions

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.