Constrained best approximation in Hilbert space

@article{Chui1990ConstrainedBA,
  title={Constrained best approximation in Hilbert space},
  author={Charles K. Chui and Frank Deutsch and Joseph D. Ward},
  journal={Constructive Approximation},
  year={1990},
  volume={6},
  pages={35-64}
}
In this paper we study the characterization of the solution to the extremal problem inf{‖x‖x ∈C ∩M}, wherex is in a Hilbert spaceH, C is a convex cone, andM is a translate of a subspace ofH determined by interpolation conditions. We introduce a simple geometric property called the “conical hull intersection property” that provides a unifying framework for most of the basic results in the subject of optimal constrained approximation. Our approach naturally lends itself to considering the data… 
Constrained best approximation in Hilbert space III. Applications ton-convex functions
This paper continues the study of best approximation in a Hilbert spaceX from a subsetK which is the intersection of a closed convex coneC and a closed linear variety, with special emphasis on
Best Approximation and Perturbation Property in Hilbert Spaces
We study the perturbation property of best approximation to a set defined by an abstract nonlinear constraint system. We show that, at a normal point, the perturbation property of best approximation
Best interpolation in seminorm with convex constraints
  • K. Zhao
  • Mathematics
    Numerical Algorithms
  • 2005
TLDR
It is shown that the constrained best interpolation problem can generally be solved by finding the saddle points of a saddle function on the whole space, and, if the explicit characterization is applicable, then solving this problem is equivalent to solving an unconstrained minimization problem for a convex function.
Interpolation from a Convex Subset of Hilbert Space: A Survey of Some Recent Results
Let C be a closed convex subset of the Hilbert space H, A a bounded linear operator from H to a finite-dimensional Hilbert space Y, b ∈ Y, and K(b) = C ∩A -1(b). A survey is given of recent results
A Dual Approach to Constrained Interpolationfrom a Convex Subset of Hilbert Space
Many interesting and important problems of best approximationare included in (or can be reduced to) one of the followingtype: in a Hilbert spaceX, find the best approximationPK(x) to anyx?Xfrom the
Interpolation and Approximation from Convex SetsII
Let X and Y be topological vector spaces, A be a continuous linear map from X to Y , C X, B be a convex set dense in C, and d 2 Y be a data point. Conditions are derived guaranteeing the set B \ A ?1
A new projection method for finding the closest point in the intersection of convex sets
TLDR
This paper presents a new iterative projection method, termed AAMR for averaged alternating modified reflections, which can be viewed as an adequate modification of the Douglas–Rachford method that yields a solution to the best approximation problem.
Infinite-dimensional convex programming with applications to constrained approximation
In this paper, existence and characterization of solutions and duality aspects of infinite-dimensional convex programming problems are examined. Applications of the results to constrained
...
...

References

SHOWING 1-10 OF 16 REFERENCES
Smoothing and Interpolation in a Convex Subset of a Hilbert Space
Interpolation and smoothing subject to convex constraints is considered. We clarify instances in a Hilbert space when the problem of finding the least norm solution to these problems can be separated
A nonlinear equation for linear programming
TLDR
It is shown thatx* is the optimal solution of (P), of minimal norm, if and only if there exists anR > 0 such that, for eachr ≥ R, the authors havex* = (rc − Atλr)+.
Convexity in a linear space with an inner product
(1) If x and y are in Jt, then kx (1 k)y is in ) for 0 <l <= 1. A line (in two-dimensional Euclidean space) or a hyperplane (in n-dimensional Euclidean space) is said to be a supporting line or
Constrained interpolation and smoothing
Numerical and theoretical questions related to constrained interpolation and smoothing are treated. The prototype problem is that of finding the smoothest convex interpolant to given univariate data.
Estimating Solutions of First Kind Integral Equations with Nonnegative Constraints and Optimal Smoothing
A method is presented for estimating solutions of Fredholm integral equations of the first kind, given noisy data. Regularization is effected by a smoothing term which is the $L^2 $-norm of the
Sequences and series in Banach spaces
I. Riesz's Lemma and Compactness in Banach Spaces. Isomorphic classification of finite dimensional Banach spaces ... Riesz's lemma ... finite dimensionality and compactness of balls ... exercises ...
ConstrainedLp approximation
In this paper, we solve a class of constrained optimization problems that lead to algorithms for the construction of convex interpolants to convex data.
A simple constraint qualification in infinite dimensional programming
A new, simple, constraint qualification for infinite dimensional programs with linear programming type constraints is used to derive the dual program; see Theorem 3.1. Applications include a proof of
The derivation of cubic splines with obstacles by methods of optimization and optimal control
SummaryInterpolating splines which are restricted in their movement by the presence of obstacles are investigated. For simplicity we mainly treat cubic splines which are required to be non-negative.
...
...