Early Termination of Convex QP Solvers in Mixed-Integer Programming for Real-Time Decision Making

The branch-and-bound optimization algorithm for mixed-integer model predictive control (MI-MPC) solves several convex quadratic program relaxations, but often the solutions are discarded based on already known integer feasible solutions. This letter presents a projection and early termination strate...

Full description

Bibliographic Details

Published in:	IEEE control systems letters Vol. 5; no. 4; pp. 1417 - 1422
Main Authors:	Liang, Jiaming, Cairano, Stefano Di, Quirynen, Rien
Format:	Journal Article
Language:	English
Published:	IEEE 01.10.2021
Subjects:	Cyber-physical systems Decision making mixed-integer programming Numerical simulation Optimization optimization algorithms Prediction algorithms Predictive control Programming Real-time systems
ISSN:	2475-1456, 2475-1456
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!