- Title
- A generalization of the Remez algorithm to a class of linear spline approximation problems with constraints on spline parameters
- Creator
- Sukhorukova, Nadezda
- Date
- 2008
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/40429
- Identifier
- vital:850
- Identifier
-
https://doi.org/10.1080/10556780802193098
- Identifier
- ISSN:1055-6788
- Abstract
- The classical Remez algorithm was developed for constructing the best polynomial approximations for continuous and discrete functions in an interval [a, b]. In this paper, the classical Remez algorithm is generalized to the problem of linear spline approximation with certain conditions on the spline parameters. Namely, the spline parameters have to be nonnegative and the values of the splines at one of the borders (or both borders) of the approximation intervals may be fixed. This type of constraint occurs in some practical applications, e.g. the problem of taxation tables restoration. The results of the numerical experiments with a Remez-like algorithm developed for this class of conditional optimization problems, are presented.; C1
- Publisher
- Taylor & Francis
- Relation
- Optimization Methods and Software Vol. 23, no. 5 (2008), p. 793-810
- Rights
- Copyright Taylor & Francis
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0101 Pure Mathematics; Linear spline approximation; Nonsmooth optimization; Remez algorithm
- Reviewed
- Hits: 1007
- Visitors: 980
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|