Chebyshev approximation by linear combinations of fixed knot polynomial splines with weighting functions
type: Item
instance of: scholarly article
title: Chebyshev approximation by linear combinations of fixed knot polynomial splines with weighting functions
zbMATH Open document ID: 1349.90842
author: N. Sukhorukova
author: Julien Ugon
published in: Journal of Optimization Theory and Applications
publication date: 2016-11-30T00:00:00Z
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 41A15
Mathematics Subject Classification ID: 41A50
zbMATH DE Number: 6657651
zbMATH Keywords: uniform approximation
zbMATH Keywords: polynomial splines
zbMATH Keywords: alternance
zbMATH Keywords: weighting functions
MaRDI profile type: Publication
full work available at URL: s10957-016-0887-0
OpenAlex ID: W2254812398
cites work: Q3995482
cites work: Approximation by generalized splines
cites work: Characterization of Chebyshev Approximations by Splines
cites work: Uniform Approximation by Chebyshev Spline Functions. II: Free Knots
cites work: Q3070580
cites work: Q3724086
cites work: Q3923054
cites work: Convex Analysis
cites work: Q4875353
cites work: Bivariate segment approximation and free knot splines: Research Problems 96-4
cites work: Convex optimisation-based methods for K-complex detection
cites work: Linear least squares problems involving fixed knots polynomial splines and their singularity study
cites work: Uniform approximation by the highest defect continuous polynomial splines: Necessary and sufficient optimality conditions and their generalisations
cites work: Q4002322
cites work: Note on Jordan elimination, linear programming and Tchebyscheff approximation
cites work: A generalization of the Remez algorithm to a class of linear spline approximation problems with constraints on spline parameters
DOI: 10.1007/S10957-016-0887-0
description: scientific article; zbMATH DE number 6657651