Best interpolation in a strip II: Reduction to unconstrained convex optimization
暂无分享,去创建一个
[1] Asen L. Dontchev,et al. Best interpolation in a strip , 1993 .
[2] John C. Holladay,et al. A smoothest curve approximation , 1957 .
[3] Carl de Boor,et al. On “best” interpolation☆ , 1976 .
[4] Asen L. Dontchev,et al. Duality and well-posedness in convex interpolation ∗) , 1989 .
[5] L. Andersson,et al. Am algorithm for constrained interpolation , 1987 .
[6] Jonathan M. Borwein,et al. Partially finite convex programming, Part II: Explicit lattice models , 1992, Math. Program..
[7] Tommy Elfving,et al. Best Constrained Approximation in Hilbert Space and Interpolation by Cubic Splines Subject to Obstacles , 1995, SIAM J. Sci. Comput..
[8] Madan L. Puri,et al. A local algorithm for constructing non-negative cubic splines , 1991 .
[9] Charles A. Micchelli,et al. ConstrainedLp approximation , 1985 .
[10] Gerhard Opfer,et al. The derivation of cubic splines with obstacles by methods of optimization and optimal control , 1987 .
[11] L. D. Irvine,et al. Constrained interpolation and smoothing , 1986 .
[12] Charles K. Chui,et al. Constrained best approximation in Hilbert space , 1990 .
[13] Jonathan M. Borwein,et al. Partially finite convex programming, Part I: Quasi relative interiors and duality theory , 1992, Math. Program..
[14] C. Micchelli,et al. Smoothing and Interpolation in a Convex Subset of a Hilbert Space , 1988 .
[15] U. Hornung,et al. Interpolation by smooth functions under restrictions on the derivatives , 1980 .