Skip to main content
Log in

BestL 1 approximation by convex functions

  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

It is shown that a function inL 1 has a best approximation by convex functions, and that the net of bestL p approximations converges asp decreases to one.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Darst and R. Huotari, BestL 1 approximation of bounded approximately continuous functions on [0,1] by nondecreasing functions, J. Approx. Theory 43 (1985) 178–189.

    Google Scholar 

  2. J. Fischer, The convergence of the best discrete linearL p approximations asp→1., J. Approx. Theory 39 (1983) 374–385.

    Google Scholar 

  3. R. Huotari, Thep-limit selection in, uniform approximation, in:Approximation Theory G. Anastassiou, ed. (Dekker, New York, 1992) pp. 325–328.

    Google Scholar 

  4. R. Huotari and D. Legg, Best monotone approximation inL 1[0, 1], Proc. Amer. Math. Soc. 94 (1985) 279–282.

    Google Scholar 

  5. R. Huotari and D. Legg, Monotone approximation in several variables, J. Approx. Theory 47 (1986) 219–227.

    Google Scholar 

  6. R. Huotari, D. Legg and D. Townsend, The Pólya algorithm on cylindrical sets, J. Approx. Theory 53 (1988) 335–349.

    Google Scholar 

  7. R. Huotari and W. Li, The continuity of metric projection, inl ∞ (n) the Pólya algorithm, the strict best approximation, and tubularity of convex sets, J. Math. Anal. Appl. 182 (1994) 836–856.

    Google Scholar 

  8. R. Huotari and S. Sahab, Metric projection onto a lattice inL 1, J. Approx. Theory 78 (1994) 155–160.

    Google Scholar 

  9. R. Huotari and D. Zwick, Approximation in the mean by convex functions, J. Numer. Funct. Anal. Optimiz. 10 (1989) 489–498.

    Google Scholar 

  10. D. Jackson, Note on the median of a set of numbers, Bull. Amer. Math. Soc. 28 (1921) 160–164.

    Google Scholar 

  11. D. Landers and L. Rogge, Natural choice ofL 1-approximants, J. Approx. Theory 33 (1981) 268–280.

    Google Scholar 

  12. D. Legg and D. Townsend, The Pólya algorithm for convex approximation, J. Math. Anal. Appl. 141 (1989) 431–441.

    Google Scholar 

  13. G. Pólya, Sur un algorithme toujours convergent pour obtenir les polinomes de meilure approximation de Tchebycheff, C. R. Acac. Sc. Paris 157 (1913) 840–843.

    Google Scholar 

  14. A. Roberts and D. Varberg,Convex Functions, (Academic Press, New York, 1973).

    Google Scholar 

  15. R. Rockafellar,Convex Analysis (Princeton University Press, 1970).

  16. O. Shisha and S. Travis,L p convergence of generalized convex functions and their uniform convergence. J. Approx. Theory 15 (1975) 366–370.

    Google Scholar 

  17. V. Stover, The strict approximation and continuous selections for the metric projection, Ph.D. Dissertation, Dept. of Math., Univ. of Cal. San Diego (1981).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gifford, D., Huotari, R. BestL 1 approximation by convex functions. Numer Algor 9, 107–111 (1995). https://doi.org/10.1007/BF02143929

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02143929

Keywords

Navigation