Constrained \(L_ p\) approximation. (English) Zbl 0582.41002
We solve a class of constrained optimization problems that lead to algorithms for the construction of convex interpolants to convex data.
MSC:
| 41A05 | Interpolation in approximation theory |
| 41A50 | Best approximation, Chebyshev systems |
| 41A15 | Spline approximation |
| 46E30 | Spaces of measurable functions (\(L^p\)-spaces, Orlicz spaces, Köthe function spaces, Lorentz spaces, rearrangement invariant spaces, ideal spaces, etc.) |
Keywords:
B-splines; optimal interpolation; constrained optimization problems; algorithms; construction of convex interpolants to convex dataReferences:
| [1] | C. de Boor (1976):On ”best” interpolation. J. Approx. Theory,16:28–42. · Zbl 0314.41001 · doi:10.1016/0021-9045(76)90093-9 |
| [2] | C.K. Chui, P.W. Smith, J.D. Ward (1976):Preferred NBV splines. J. Math. Anal. Appl.,55:18–31. · Zbl 0337.41013 · doi:10.1016/0022-247X(76)90274-2 |
| [3] | P. Copley, L.L. Schumaker (1978):On pL q -splines. J. Approx. Theory,23:1–28. · Zbl 0409.41004 · doi:10.1016/0021-9045(78)90075-8 |
| [4] | J. Favard (1940):Sur l’interpolation. J. Math. Pures, Appl.,19:281–306. · Zbl 0026.01201 |
| [5] | U. Hornung (1980):Interpolation by smooth fonctions under restrictions on the derivatives. J. Approx. Theory,28:227–237. · Zbl 0432.41001 · doi:10.1016/0021-9045(80)90077-5 |
| [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. · Zbl 0303.41011 · doi:10.1090/S0002-9947-1975-0367512-0 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
