38 citations · 39 across the 3 of their papers we have counts for
1 paper · 2 filters
M. Paul Laiu, André L. Tits
A framework is proposed for solving general convex quadratic programs (CQPs) from an infeasible starting point by invoking an existing feasible-start algorithm tailored for inequal…