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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
C. de Boor (1976):On “best” interpolation. J. Approx. Theory,16:28–42.
C.K. Chui, P.W. Smith, J.D. Ward (1976):Preferred NBV splines. J. Math. Anal. Appl.,55:18–31.
P. Copley, L.L. Schumaker (1978):On pL q -splines. J. Approx. Theory,23:1–28.
J. Favard (1940):Sur l'interpolation. J. Math. Pures, Appl.,19:281–306.
U. Hornung (1980):Interpolation by smooth fonctions under restrictions on the derivatives. J. Approx. Theory,28:227–237.
G. Iliev, W. Pollul:Convex interpolation with minimal L ∞-norm of the second derivative. Unpublished manuscript.
S. Karlin (1975):Interpolation properties of generalized perfect splines and the solutions of certain extremal problems, I. Trans. Amer. Math. Soc.,106:25–66.
Author information
Authors and Affiliations
Additional information
Communicated by Larry L. Schumaker.
Rights 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
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01890024