On the characterization and computation of best monotone approximation in \(L_ p[0,1]\) for \(1\leq p<\infty\)

DOI10.1016/0021-9045(90)90073-YzbMath0693.41016OpenAlexW1981245421MaRDI QIDQ908455

Yuesheng Xu, John J. Swetits, Stanley E. Weinstein

Publication date: 1990

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9045(90)90073-y

zbMATH Keywords

algorithms\(L_ p\) approximationclosed convex latticeConstructive solutions

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation by other special function classes (41A30)

Related Items (8)

Characterizing best isotone approximations in \(L_p\) spaces, \(1 \leq p < \infty\) ⋮ Approximation inL_p[0,1 byn-convex functions] ⋮ Unnamed Item ⋮ Best Simultaneous Monotone Approximants in Orlicz Spaces ⋮ The computation of a best monotoneL_papproximation for 1 ≤p< ∞ ⋮ Best \(L_ p\) approximation with multiple constraints for \(1\leq p<\infty\) ⋮ The error in discrete \(\Phi\)-approximation ⋮ Best quasi-convex uniform approximation

Cites Work

• Unnamed Item
• Unnamed Item
• Best approximation by monotone functions
• 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: On the characterization and computation of best monotone approximation in \(L_ p[0,1]\) for \(1\leq p<\infty\)