# A primal-dual regularized interior-point method for convex quadratic programs

Mathematical Programming Computation, 4(1):71–107, 2012

Mathematical Programming Computation, 4(1):71–107, 2012

The code for the interior algorithm is implemented as part of the NLPy optimization package.