38 citations · 39 across the 3 of their papers we have counts for
3 papers
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…
physics.comp-ph2013★ 38 cited
Adaptive change of basis in entropy-based moment closures for linear kinetic equations
Graham W. Alldredge, Cory D. Hauck, Dianne P. O'Leary +1
Entropy-based (M_N) moment closures for kinetic equations are defined by a constrained optimization problem that must be solved at every point in a space-time mesh, making it impor…