Skip to main content
Log in

ConstrainedL p approximation

  • Published:
Constructive Approximation Aims and scope

Abstract

In this paper, we solve a class of constrained optimization problems that lead to algorithms for the construction of convex interpolants to convex data.

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.

Similar content being viewed by others

References

  1. C. de Boor (1976):On “best” interpolation. J. Approx. Theory,16:28–42.

    Google Scholar 

  2. C.K. Chui, P.W. Smith, J.D. Ward (1976):Preferred NBV splines. J. Math. Anal. Appl.,55:18–31.

    Google Scholar 

  3. P. Copley, L.L. Schumaker (1978):On pL q -splines. J. Approx. Theory,23:1–28.

    Google Scholar 

  4. J. Favard (1940):Sur l'interpolation. J. Math. Pures, Appl.,19:281–306.

    Google Scholar 

  5. U. Hornung (1980):Interpolation by smooth fonctions under restrictions on the derivatives. J. Approx. Theory,28:227–237.

    Google Scholar 

  6. G. Iliev, W. Pollul:Convex interpolation with minimal L -norm of the second derivative. Unpublished manuscript.

  7. S. Karlin (1975):Interpolation properties of generalized perfect splines and the solutions of certain extremal problems, I. Trans. Amer. Math. Soc.,106:25–66.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by Larry L. Schumaker.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Micchelli, C.A., Smith, P.W., Swetits, J. et al. ConstrainedL p approximation. Constr. Approx 1, 93–102 (1985). https://doi.org/10.1007/BF01890024

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

AMS (MOS) classification (1980)

Key words and phrases

Navigation