1 citations · 1 across the 1 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2019★ 1 cited
An Infeasible-Start Framework for Convex Quadratic Optimization, with Application to Constraint-Reduced Interior-Point Methods
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…
math.OC2018
A Constraint-Reduced MPC Algorithm for Convex Quadratic Programming, with a Modified Active Set Identification Scheme
M. Paul Laiu, André L. Tits
A constraint-reduced Mehrotra-Predictor-Corrector algorithm for convex quadratic programming is proposed. (At each iteration, such algorithms use only a subset of the inequality co…