Constrained best approximation in Hilbert space. II
type: Item
instance of: scholarly article
title: Constrained best approximation in Hilbert space. II
zbMATH Open document ID: 0796.41026
DOI: 10.1016/0021-9045(92)90117-7
author: Charles K. Chui
author: F. Deutsch
author: J. D. Ward
published in: Journal of Approximation Theory
publication date: 1993-01-17T00:00:00Z
review text: [For part I see Constructive Approximation 6, No. 1, 35-64 (1990; Zbl 0682.41034).] Let \(X\) and \(Y\) be Hilbert spaces with \(Y\) being finite-dimensional. Suppose \(A\) a bounded linear operator from \(X\) into \(Y\), \(C\) a closed convex cone in \(X\), \(d\in AC\) and \(K=C\cap A^{-1}(d)\). In this paper the authors firstly prove that for each \(x\in X\), \(P_ K(x)= P_{C_ F} (x+A^*y)\) for any \(y\in Y\) which satisfies \(A(P_{C_ F} (x+A^* y))=d\), where \(P_ Z(z)\) is the unique best approximation of \(z\) in \(Z\), \(F\) is the minimal convex extremal subset of \(AC\) which contains \(d\) and \(C_ F= C\cap A^{-1} (F)\). The main results of the paper are three applications of the above results. The first application concerns the case when \(X= L_ 1(\mu)\), \(C\) is the cone of positive functions in \(X\) and \(A\) is a bounded linear operator form \(X\) into \(\ell_ 1(n)\). The second corresponds to the case \(X=L_ 2(a,b)\), \(C\) is the cone of increasing functions in \(X\) and \(A\) is as above. The third case disposes of the cone of convex functions. Finally they deal with the minimization problem described above in the case that \(C\) is an arbitrary closed convex set.
Mathematics Subject Classification ID: 41A65
Mathematics Subject Classification ID: 41A50
zbMATH DE Number: 97529
zbMATH Keywords: unique best approximation
zbMATH Keywords: minimization problem
reviewed by: Zhang Guanglu
MaRDI profile type: Publication
full work available at URL: 0021-9045(92)90117-7
OpenAlex ID: W2021048962
cites work: A practical guide to splines
cites work: Partially finite convex programming. II: Explicit lattice models
cites work: Q3916398
cites work: A simple constraint qualification in infinite dimensional programming
cites work: Constrained best approximation in Hilbert space
cites work: Q3694559
cites work: Characterizing best isotone approximations in \(L_p\) spaces, \(1 \leq p < \infty\)
cites work: Dual cones, constrained \(n\)-convex, \(L_ p\)-approximation, and perfect splines
cites work: Q3802002
cites work: Q3254057
cites work: $L_2 $ Spectral Estimation
cites work: A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
cites work: Q4104377
cites work: Constrained interpolation and smoothing
cites work: Q4184629
cites work: Constrained \(L_ p\) approximation
cites work: Smoothing and Interpolation in a Convex Subset of a Hilbert Space
cites work: Duality and stability in extremum problems involving convex functions
cites work: Q5638112
Recommended article: Constrained best approximation in Hilbert space III. Applications of \(n\)-convex functions
Recommended article: Adaptive algorithms in the parametrized method of centers
Recommended article: Q4250283
Recommended article: Q4888593
Recommended article: Q4725083
Recommended article: Minimization of quadratic functionals on cones in Hilbert spaces
Recommended article: A Global Approach to Nonlinearly Constrained Best Approximation
Recommended article: Constrained best approximation in Hilbert space
Recommended article: On Best Approximation by Nonconvex Sets and Perturbation of Nonconvex Inequality Systems in Hilbert Spaces
Recommended article: Q4490273
description: scientific article; zbMATH DE number 97529