An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods.

M. Paul Laiu André L. Tits An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods. 327-366 2022 195 Math. Program. 1 https://doi.org/10.1007/s10107-021-01692-5 db/journals/mp/mp195.html#LaiuT22