Best interpolation in seminorm with convex constraints
From MaRDI portal
Publication:1893534
DOI10.1007/BF02143931zbMath0822.41030MaRDI QIDQ1893534
Publication date: 4 July 1995
Published in: Numerical Algorithms (Search for Journal in Brave)
variational problemprojectionsaddle pointsconvex constraintsseminormbest interpolation in Hilbert spaceclosed linear mapexplicit characterizations
Numerical interpolation (65D05) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Interpolation in approximation theory (41A05) Approximation with constraints (41A29)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On constrained multivariate splines and their approximations
- Constrained best approximation in Hilbert space. II
- Best interpolation with convex constraints
- Constrained best approximation in Hilbert space
- Smoothness indices for convex functions and the unique Hahn-Banach extension problem
- Smoothing and Interpolation in a Convex Subset of a Hilbert Space
- Smoothing and interpolation in a convex subset of a Hilbert space : II. The semi-norm case