Under the framework of this representation, the proposed method can be solved by using an alternating minimization algorithm. Numerical examples are presented ...

Sep 9, 2016 · To alleviate these restrictions, we develop a novel low-complexity, iterative method for a class of non-convex, non-smooth optimization problems ...

Our algorithm departs from the traditional MIP formulation and leads to a simple, embeddable method that only requires matrix-vector multiplications and small- ...

In this paper, we develop an algorithm based on operator splitting to address hybrid MPC problems, that provides both the desired theoretical guarantees and ...

This paper considers designing real-time Model Predictive Control for embedded control applications where both continuous-valued and discrete-valued control ...

To alleviate these restrictions, we develop a novel low-complexity, iterative method for a class of non-convex, non-smooth optimization problems. This class of ...

Low-Complexity Method for Hybrid MPC with Local Guarantees. Overview of attention for article published in SIAM Journal on Control & Optimization, July 2019.

Low-Complexity Method for Hybrid MPC with Local Guarantees. Overview of attention for article published in SIAM Journal on Control & Optimization, July 2019.

Low-complexity method for hybrid MPC with local guarantees. Published: 2016 ... To alleviate these restrictions, we develop a novel low-complexity, iterative …

2017. Low-complexity method for hybrid mpc with local guarantees. D Frick, A Georghiou, JL Jerez, A Domahidi, M Morari. SIAM Journal on Control and ...