Best approximation from the intersection of a closed convex set and a polyhedron in Hilbert space, weak slater conditions, and the strong conical hull intersection property Academic Article uri icon

abstract

  • Let X be a (real) Hilbert space, C be a closed convex subset, and Hi= {x X bi} (i = 1,2,...,m) be a finite collection of half-spaces. Under the assumption that K := C (m1Hi) is not empty, the problem of characterizing the best approximation from K to any x X is considered. The "strong conical hull intersection property" (strong CHIP), which was introduced by us in 1997, is shown to be both necessary and sufficient for the following "perturbation property" to hold: for each x X, an element xo K satisfies xo= PK(x) if and only if xo= PC(x - m1ihi) for some scalars i 0 with i[ - bi] = 0 for each i. Here PD(z) denotes the unique best approximation from D to z. In other words, determining the best approximation from the set K to any point is equivalent to the (generally easier) problem of determining the best approximation from the set C to a perturbation of that point. Moreover, even when the strong CHIP does not hold, the perturbation property still holds, except now C must be replaced by a certain convex extremal subset of C. We also show that the strong CHIP is weaker than any of the weak Slater conditions that one can naturally impose on the sets in question. These results generalize the main results of our 1997 paper [J. Approx. Theory, 90, pp. 385-444] and hence those of several other papers as well.

published proceedings

  • SIAM JOURNAL ON OPTIMIZATION

author list (cited authors)

  • Deutsch, F., Li, W., & Ward, J. D.

citation count

  • 42

complete list of authors

  • Deutsch, F||Li, W||Ward, JD

publication date

  • January 1, 1999 11:11 AM