Optimal solution characterization for infinite positive semi-definite programming

We give a set-theoretic description of the set of optimal solutions to a general positive semi-definite quadratic programming problem over an affine set. We also show that the solution space is again an affine set, thus offering the opportunity to find an optimal solution by solving a corresponding operator equation.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/31452/1/0000373.pd