Darn, no benchmark against Ipopt, which in my experience still gives the best black-box performance on large, sparse quadratic problems. In my experience the commercial solvers (Gurobi, Mosek) are actually quite slow.
As I said there, the current IPOPT Python interfaces do not report the timings. If you are aware of any fair way to time it from Python, I would be happy to add it. In my opinion using the Python "time" module can cause lags due to the Python interpreter.
