Constrained best approximation in Hilbert space. II
From MaRDI portal
Publication:1201286
DOI10.1016/0021-9045(92)90117-7zbMath0796.41026MaRDI QIDQ1201286
Frank Deutsch, Charles K. Chui, Joseph D. Ward
Publication date: 17 January 1993
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9045(92)90117-7
41A50: Best approximation, Chebyshev systems
41A65: Abstract approximation theory (approximation in normed linear spaces and other abstract spaces)
Related Items
NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING, Smoothing spline in a convex closed set of Hilbert space, Strong CHIP, normality, and linear regularity of convex sets, Best Approximation in a Class of Normed Spaces with Star-Shaped Cone, On basic constraint qualifications for infinite system of convex Inequalities in Banach spaces, Subdifferential set of the supremum of lower semi-continuous convex functions and the conical hull intersection property, On best constrained interpolation, Facial reduction in partially finite convex programming, A dual approach to constrained interpolation from a convex subset of Hilbert space, Interpolation and approximation from convex sets, Interpolation and approximation from convex sets. II: Infinite-dimensional interpolation, Best interpolation in seminorm with convex constraints, On best restricted range approximation in continuous complex-valued function spaces
Cites Work
- Constrained \(L_ p\) approximation
- Constrained interpolation and smoothing
- Partially finite convex programming. II: Explicit lattice models
- A practical guide to splines
- Constrained best approximation in Hilbert space
- Dual cones, constrained \(n\)-convex, \(L_ p\)-approximation, and perfect splines
- Duality and stability in extremum problems involving convex functions
- Characterizing best isotone approximations in \(L_p\) spaces, \(1 \leq p < \infty\)
- A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
- A simple constraint qualification in infinite dimensional programming
- $L_2 $ Spectral Estimation
- Smoothing and Interpolation in a Convex Subset of a Hilbert Space
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
