Best \(L_ 1\) approximation by convex functions
type: Item
instance of: scholarly article
title: Best \(L_ 1\) approximation by convex functions
zbMATH Open document ID: 0823.41025
DOI: 10.1007/BF02143929
author: Robert Huotari
author: David K. Gifford
published in: Numerical Algorithms
publication date: 1995-07-04T00:00:00Z
Mathematics Subject Classification ID: 41A50
zbMATH DE Number: 770299
zbMATH Keywords: best approximation by convex functions
MaRDI profile type: Publication
cites work: Best \(L_ 1\)-approximation of bounded, approximately continuous functions on [0,1] by nondecreasing functions
cites work: The convergence of the best discrete linear \(L_ p\) approximation as p\(\to 1\)
cites work: Q4016584
cites work: Best Monotone Approximation in L 1 [ 0, 1 ]
cites work: Monotone approximation in several variables
cites work: The Polya algorithm on cylindrical sets
cites work: Continuity of metric projection, Pólya algorithm, strict best approximation, and tubularity of convex sets
cites work: Metric projection onto a lattice in \(L_ 1\)
cites work: Approximation in the mean by convex functions
cites work: Natural choice of \(L_ 1-\)approximants
cites work: The Polya algorithm for convex approximation
cites work: Q3215459
cites work: Convex Analysis
cites work: \(L_p\) convergence of generalized convex functions and their uniform convergence
description: scientific article; zbMATH DE number 770299