The following pages link to André L. Tits (Q240211):
Displaying 8 items.
- Adaptive change of basis in entropy-based moment closures for linear kinetic equations (Q348610) (← links)
- A constraint-reduced variant of Mehrotra's predictor-corrector algorithm (Q429507) (← links)
- Adaptive constraint reduction for convex quadratic programming (Q434155) (← links)
- Universal duality in conic convex optimization (Q868444) (← links)
- Newton-KKT interior-point methods for indefinite quadratic programming (Q885826) (← links)
- An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods (Q2089775) (← links)
- Addressing rank degeneracy in constraint-reduced interior-point methods for linear optimization (Q2250064) (← links)
- A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme (Q2419534) (← links)
