Tailored presolve techniques in branch‐and‐bound method for fast mixed‐integer optimal control applications
DOI10.1002/OCA.3030arXiv2211.12700OpenAlexW4382403803MaRDI QIDQ6180277FDOQ6180277
Authors: Rien Quirynen, S. Di Cairano
Publication date: 19 January 2024
Published in: Optimal Control Applications \& Methods (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.12700
Recommendations
- Fast Numerical Methods for Mixed-Integer Nonlinear Model-Predictive Control
- Mixed-integer formulations for optimal control of piecewise-affine systems
- LMI-based robust mixed-integer model predictive control for hybrid systems
- PRESAS: Block‐structured preconditioning of iterative solvers within a primal active‐set method for fast model predictive control
- Efficient online solution of multi-parametric mixed-integer quadratic problems
Quadratic programming (90C20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11) Model predictive control (93B45)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Control of systems integrating logic, dynamics, and constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- Branching rules revisited
- Improving the feasibility pump
- Dynamic programming for constrained optimal control of discrete-time linear hybrid systems
- Mixed integer programming: analyzing 12 years of progress
- The integer approximation error in mixed-integer optimal control
- Convex relaxations for mixed integer predictive control
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Explicit hybrid model-predictive control: the exact solution
- Mixed-integer quadratic programming is in NP
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Presolve Reductions in Mixed Integer Programming
- Detecting infeasibility in infeasible-interior-point methods for optimization
- Mixed-integer formulations for optimal control of piecewise-affine systems
- An abstract model for branching and its application to mixed integer programming
- A general system for heuristic minimization of convex functions over non-convex sets
- Online Mixed-Integer Optimization in Milliseconds
- Warm Start of Mixed-Integer Programs for Model Predictive Control of Hybrid Systems
- PRESAS: Block‐structured preconditioning of iterative solvers within a primal active‐set method for fast model predictive control
This page was built for publication: Tailored presolve techniques in branch‐and‐bound method for fast mixed‐integer optimal control applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6180277)