Algorithms for infinite quadratic programming in spaces

We study infinite dimensional quadratic programming problems of an integral type. The decision variable is taken in the L p space where 1 < p < ∞ . In this paper the decision variable is required to have a lower bound and an upper bound on a compact interval. Two numerical algorithms are proposed for solving these problems, and the convergence properties of the proposed algorithms are given. Two numerical examples are also given to implement the proposed algorithms.