Best interpolation with convex constraints

DOI10.1006/jath.1993.1033zbMath0785.41025OpenAlexW2058055922MaRDI QIDQ1801554

Kang Zhao

Publication date: 17 August 1993

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jath.1993.1033

zbMATH Keywords

projectionlocally convex spacesKuhn-Tucker type conditions

Mathematics Subject Classification ID

Convex programming (90C25) Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Interpolation in approximation theory (41A05)

Related Items (3)

Smooth and Semismooth Newton Methods for Constrained Approximation and Estimation ⋮ Best interpolation in seminorm with convex constraints ⋮ A dual approach to constrained interpolation from a convex subset of Hilbert space

This page was built for publication: Best interpolation with convex constraints