Construction of the best monotone approximation on \(L_ p[0,1]\)
From MaRDI portal
Publication:915051
DOI10.1016/0021-9045(90)90028-OzbMath0702.41048MaRDI QIDQ915051
Stanley E. Weinstein, John J. Swetits
Publication date: 1990
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation with constraints (41A29)
Related Items (5)
Best Simultaneous Monotone Approximants in Orlicz Spaces ⋮ Best constant approximants in Lorentz spaces ⋮ Weak inequalities for maximal functions in Orlicz-Lorentz spaces and applications ⋮ The computation of a best monotoneLpapproximation for 1 ≤p< ∞ ⋮ The error in discrete \(\Phi\)-approximation
Cites Work
- Best approximation by monotone functions
- Monotone approximation in several variables
- The natural best \(L^ 1\)-approximation by nondecreasing functions
- Natural choice of \(L_ 1-\)approximants
- Isotone optimization. II
- Isotone optimization. I
- Best \(L_ 1\)-approximation of bounded, approximately continuous functions on [0,1 by nondecreasing functions]
- Best Monotone Approximation in L 1 [ 0, 1 ]
This page was built for publication: Construction of the best monotone approximation on \(L_ p[0,1]\)