Long step path-following algorithm for the convex quadratic programming in a Hilbert space

We develop an interior-point technique for solving quadratic programming problem in a Hilbert space. As an example we consider an application of these results to the linear-quadratic control problem with linear inequality constraints. It is shown that the Newton step in this situation is basically reduced to solving the standard linear-quadratic control problem.