Optimality conditions for quadratic programming problems in Hilbert spaces (Q2240564)

This paper considers quadratic programming problems with convex quadratic constrains in Hilbert spaces. The author begins with an introduction to optimization problems in a real Hilbert space and their differences compared to those in Euclidean spaces. In the second section the preliminary definitions and background results are outlined, before presenting and proving the first-order necessary and sufficient optimality conditions for this optimization problem. The fourth section considers the second-order necessary and sufficient conditions, and the necessary assumptions, for this problem.