Best \(L_ 1\) approximation by convex functions
From MaRDI portal
Publication:1893532
DOI10.1007/BF02143929zbMath0823.41025MaRDI QIDQ1893532
Robert Huotari, David K. Gifford
Publication date: 4 July 1995
Published in: Numerical Algorithms (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- The convergence of the best discrete linear \(L_ p\) approximation as p\(\to 1\)
- Monotone approximation in several variables
- The Polya algorithm on cylindrical sets
- Natural choice of \(L_ 1-\)approximants
- \(L_p\) convergence of generalized convex functions and their uniform convergence
- Continuity of metric projection, Pólya algorithm, strict best approximation, and tubularity of convex sets
- Metric projection onto a lattice in \(L_ 1\)
- The Polya algorithm for convex approximation
- Best \(L_ 1\)-approximation of bounded, approximately continuous functions on [0,1 by nondecreasing functions]
- Approximation in the mean by convex functions
- Best Monotone Approximation in L 1 [ 0, 1 ]
- Convex Analysis
