HOPDM
Package for solving large-scale linear, convex quadratic and convex nonlinear programming problems. The code is an implementation of the infeasible primal-dual interior point method, and compares favorably with commercial LP, QP and NLP packages.

No queries for www.maths.ed.ac.uk/~gondzio/software/hopdm.html