Best interpolation in a strip. II: Reduction to unconstrained convex optimization

DOI10.1007/BF00248266zbMath0851.90090MaRDI QIDQ1915770

Ilya V. Kolmanovsky, Asen L. Dontchev

Publication date: 5 August 1996

Published in: Computational Optimization and Applications (Search for Journal in Brave)

zbMATH Keywords

interpolationsplinesconstrained best approximation

Mathematics Subject Classification ID

Convex programming (90C25) Interpolation in approximation theory (41A05)

Related Items (2)

Markov-Dubins interpolating curves ⋮ Constrained data smoothing via optimal control

Cites Work

• Unnamed Item
• A local algorithm for constructing non-negative cubic splines
• Constrained \(L_ p\) approximation
• Constrained interpolation and smoothing
• The derivation of cubic splines with obstacles by methods of optimization and optimal control
• Interpolation by smooth functions under restrictions on the derivatives
• Partially finite convex programming. I: Quasi relative interiors and duality theory
• On 'best' interpolation
• Best interpolation in a strip
• Constrained best approximation in Hilbert space
• State constraints in the linear regulator problem: Case study
• A Smoothest Curve Approximation
• An Algorithm for Constrained Interpolation
• Smoothing and Interpolation in a Convex Subset of a Hilbert Space
• Duality and well-posedness in convex interpolation^∗)
• Best Constrained Approximation in Hilbert Space and Interpolation by Cubic Splines Subject to Obstacles

This page was built for publication: Best interpolation in a strip. II: Reduction to unconstrained convex optimization