A geometric programming approach for bivariate cubic L₁ splines
This paper deals with a geometric programming approach to get bivariate cubic \(L_1\) splines. Recently this new class of polynomial splines has been introduced and developed in the univariate case. In fact, while conventional polynomial splines have excellent approximatation power and ensure efficient evaluation, but they do not ``preserve shape well, cubic \(L_1\) splines provide \(C^1\)-smooth, shape-preserving interpolation of data, including those with abrupt changes in spacing and magnitude. The authors of the present paper extend the geometric programming framework from univariate to bivariate case. The coefficients of \(L_1\) splines are obtained by minimizing the \(L_1\) norm of second partial derivatives of candidate \(C^1\)-smooth piecewise cubic surfaces. This process is equivalent to solving a non linear programming problem with a convex feasible region and a nondifferentiable convex objective function. The nondifferentiability of the objective function makes it difficult to directly characterize the corresponding optimality condition and traditional nonlinear programming techniques can hardly be applied directly to this nonsmooth optimization problem. The use of geometric programming can alleviate this problem by transforming it into a differentiable convex dual programming problem with a linear objective function and convex cubic constraints. It is now possible to apply any general-purpose nonlinear solver to find a dual solution. A primal optimal solution is then obtained from the dual one by satisfying suitable optimality conditions. Since the dual problem is ``simpler than the primal one, theoretical investigations of shape-preserving properties of bivariate cubic \(L_1\) splines can be better carried out using the dual solution. Computational experiments are also presented.
- Univariate cubic \(L_1\) splines -- a geometric programming approach
- A geometric programming framework for univariate cubic L₁ smoothing splines
- Geometric dual formulation for first-derivative-based univariate cubic \(L_{1}\) splines
- Shape-preserving properties of univariate cubic \(L_{1}\) splines
- Cubic L₁ splines on triangulated irregular networks
- An efficient algorithm for generating univariate cubic \(L_1\) splines
- Fitting Monotone Surfaces to Scattered Data Using C1 Piecewise Cubics
- Geometric Programming
- scientific article; zbMATH DE number 412098 (Why is no real title available?)
- scientific article; zbMATH DE number 439946 (Why is no real title available?)
- scientific article; zbMATH DE number 3703310 (Why is no real title available?)
- scientific article; zbMATH DE number 44907 (Why is no real title available?)
- scientific article; zbMATH DE number 1260578 (Why is no real title available?)
- scientific article; zbMATH DE number 271420 (Why is no real title available?)
- scientific article; zbMATH DE number 3272827 (Why is no real title available?)
- Shape-preserving properties of univariate cubic \(L_{1}\) splines
- Shape-preserving, multiscale fitting of univariate data by cubic \(L_1\) smoothing splines
- Shape-preserving, multiscale interpolation by bi- and multivariate cubic \(L_{1}\) splines
- State Constraints in Convex Control Problems of Bolza
- Symmetric Duality for Generalized Unconstrained Geometric Programming
- Univariate cubic \(L_1\) splines -- a geometric programming approach
- Univariate cubic \(L_{p}\) splines and shape-preserving, multiscale interpolation by univariate cubic \(L_{1}\) splines
- Geometric control of \(G^{2}\)-cubic A-splines
- Univariate cubic \(L_1\) splines -- a geometric programming approach
- On shape-preserving capability of cubic \(L^1\) spline fits
- 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
- Approximating term structure of interest rates using cubic \(L_1\) splines
- Geometric dual formulation for first-derivative-based univariate 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
- Cubic L₁ splines on triangulated irregular networks
- Fast \(L_1^kC^k\) polynomial spline interpolation algorithm with shape-preserving properties
- An efficient algorithm for generating univariate cubic \(L_1\) splines
- A compressed primal-dual method for generating bivariate cubic \(L_{1}\) splines
This page was built for publication: A geometric programming approach for bivariate cubic \(L_{1}\) splines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2485428)
