An efficient algorithm for generating univariate cubic \(L_1\) splines (Q702483): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1023/B:COAP.0000042031.03626.1b / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/b:coap.0000042031.03626.1b / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2044839389 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1023/B:COAP.0000042031.03626.1B / rank | |||
Normal rank | |||
Latest revision as of 01:10, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for generating univariate cubic \(L_1\) splines |
scientific article |
Statements
An efficient algorithm for generating univariate cubic \(L_1\) splines (English)
0 references
17 January 2005
0 references
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.
0 references
cubic splines
0 references
geometric programming
0 references
primal affine algorithm
0 references
iterations
0 references
stability
0 references
computational efficiency
0 references
active set method
0 references
convex programming
0 references
