A path following algorithm for infinite quadratic programming on a Hilbert space
Andrew E. B. Lim, John B. Moore · Discrete and Continuous Dynamical Systems · 1998
In this paper, we consider a path following algorithm for solving infinite quadratic programming problems. The convergence properties of a smoothly parametrized curve, known as the central trajectory, is studied. We show that the points of this curve converge to the optimal solution of the problem, so by approximating this curve, solutions arbitrarily close to the optimal solution can be calculated. As an example, we consider the linear-quadratic optimal control problem with state inequality constraints at every time instant.