Infinite positive-definite quadratic programming in a Hilbert space

This note generalizes the results of Benson, Smith, Schochetman, and Bean (Ref. 1) regarding the minimization of a positive-definite functional over the countable intersection of closed convex sets in a Hilbert space. A finite approximating subproblem for the general case is shown to have the same strong convergence properties of the earlier work without any of the specialized structures imposed therein. In particular, the current development does not rely on any properties ofl² and does not require the Hilbert space to be separable.