A duality approach to best uniform convex approximation

DOI10.1016/0022-247X(91)90308-MzbMath0764.41035OpenAlexW2088512155MaRDI QIDQ1192528

Yuesheng Xu, Stanley E. Weinstein

Publication date: 27 September 1992

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(91)90308-m

zbMATH Keywords

best monotone approximationbest quasi- convex approximationerror of best approximation

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Remainders in approximation formulas (41A80)

Related Items (2)

A duality approach to regularized learning problems in Banach spaces ⋮ Duality and Lipschitzian selections in best approximation from nonconvex cones

Cites Work

• Best quasi-convex uniform approximation
• An O(n) algorithm for discrete n-point convex approximation with applications to continuous case
• Isotone optimization. II
• Isotone optimization. I
• Best Approximation by Convex Functions
• Moduli of Monotonicity with Applications to Monotone Polynomial Approximation
• Another Proof that Convex Functions are Locally Lipschitz
• Extremal positive splines with applications to interpolation and approximation by generalized convex functions

This page was built for publication: A duality approach to best uniform convex approximation