Algorithms for infinite quadratic programming in \(L_p\) spaces (Q2479348)

The infinite dimensional quadratic programming problems of an integral type is investigated. The decision variable is taken in the \(L_p\) space where \(1<p<\infty\). The decision variable in this approach is required to have a lower bound and an upper bound on a compact interval. For the solution of these problems, two numerical algorithms are proposed and the convergence properties of the proposed algorithms are given. Two numerical examples are presented for the implementation of the proposed algorithms.