The computation of a best monotoneLpapproximation for 1 ≤p< ∞

DOI10.1080/01630569008816403zbMath0733.65007OpenAlexW2061825571MaRDI QIDQ3359637

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

Publication date: 1990

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630569008816403

zbMATH Keywords

algorithmConvergencecontinuous functionRiemann integrable functionbest nondecreasing \(L_ p\) approximation

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Algorithms for approximation of functions (65D15)

Cites Work

• Unnamed Item
• Unnamed Item
• Best approximation by monotone functions
• On the characterization and computation of best monotone approximation in \(L_ p[0,1\) for \(1\leq p<\infty\)]
• Construction of the best monotone approximation on \(L_ p[0,1\)]
• The natural best \(L^ 1\)-approximation by nondecreasing functions
• Isotone optimization. II
• Isotone optimization. I
• Applications of the Hahn-Banach Theorem in Approximation Theory
• What is the Laplace Transform?

This page was built for publication: The computation of a best monotoneL_papproximation for 1 ≤p< ∞