Nonlinear approximation theory
Nonlinear approximation theory
SIAM Journal on Mathematical Analysis
Solution of steady-state one-dimensional conservation laws by mathematical programming
SIAM Journal on Numerical Analysis
Linear optimization and extensions: theory and algorithms
Linear optimization and extensions: theory and algorithms
Computer Aided Geometric Design
Shape-preserving, multiscale fitting of univariate data by cubic L1 smoothing splines
Computer Aided Geometric Design
Shape-preserving approximation of multiscale univariate data by cubic L1 spline fits
Computer Aided Geometric Design
An Efficient Algorithm for Generating Univariate Cubic L1 Splines
Computational Optimization and Applications
Shape-preserving properties of univariate cubic L1 splines
Journal of Computational and Applied Mathematics
Shape-preserving, first-derivative-based parametric and nonparametric cubic L1 spline curves
Computer Aided Geometric Design
A compressed primal-dual method for generating bivariate cubic L1 splines
Journal of Computational and Applied Mathematics
The Legendre-Fenchel Conjugate of the Product of Two Positive Definite Quadratic Forms
SIAM Journal on Matrix Analysis and Applications
Computational Optimization and Applications
Robust univariate spline models for interpolating interval data
Operations Research Letters
Hi-index | 0.00 |
With the objective of generating "shape-preserving" smooth interpolating curves that represent data with abrupt changes in magnitude and/or knot spacing, we study a class of first-derivative-based $$\mathcal{C}^1$$ -smooth univariate cubic L 1 splines. An L 1 spline minimizes the L 1 norm of the difference between the first-order derivative of the spline and the local divided difference of the data. Calculating the coefficients of an L 1 spline is a nonsmooth non-linear convex program. Via Fenchel's conjugate transformation, the geometric dual program is a smooth convex program with a linear objective function and convex cubic constraints. The dual-to-primal transformation is accomplished by solving a linear program.