Summary: We study a form of convex quadratic semi-infinite programming problems with finitely many variables and infinitely many constraints over a compact metric space. An entropic path-following algorithm is introduced with a convergence proof. Some practical implementations and numerical experiments are also included.