Best interpolation with convex constraints

DOI10.1006/JATH.1993.1033MaRDI QIDQ1801554zbMATH OpenOpenAlexFDO

Authors 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) Interpolation in approximation theory (41A05) Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Recommendations

• Best interpolation in seminorm with convex constraints
• Constrained best approximation in Hilbert space. II
• Smoothing and interpolation in a convex subset of a Hilbert space : II. The semi-norm case
• Best interpolatory approximation in normed linear spaces
• Constrained best approximation in Hilbert space

Cited in

(6)

• Interpolation by conic model for unconstrained optimization
• Best interpolation in seminorm with convex constraints
• A dual approach to constrained interpolation from a convex subset of Hilbert space
• Smooth and semismooth Newton methods for constrained approximation and estimation
• Armijo Newton method for convex best interpolation
• Proximity for sums of composite functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801554)