mlsanityData to 14 Oct 2026

A construction-free coordinate-descent augmented-Lagrangian method for embedded linear MPC based on ARX models

arXiv 2207.06098 ↗First posted 13 Jul 2022math.OC cs.SY eess.SYcited by 1

Not on the map. Why?

Abstract (arXiv)

This paper proposes a construction-free algorithm for solving linear MPC problems based on autoregressive with exogenous terms (ARX) input-output models. The solution algorithm relies on a coordinate-descent augmented Lagrangian (CDAL) method previously proposed by the authors, which we adapt here to exploit the special structure of ARX-based MPC. The CDAL-ARX algorithm enjoys the construction-free feature, in that it avoids explicitly constructing the quadratic programming (QP) problem associated with MPC, which would eliminate construction cost when the ARX model changes/adapts online. For example, the ARX model parameters are dependent on linear parameter-varying (LPV) scheduling signals, or recursively adapted from streaming input-output data with cheap computation cost, which make the ARX model widely used in adaptive control. Moreover, the implementation of the resulting CDAL-ARX algorithm is matrix-free and library-free, and hence amenable for deployment in industrial embedded platforms. We show the efficiency of CDAL-ARX in two numerical examples, also in comparison with MPC implementations based on other general-purpose quadratic programming solvers.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 13 Jul 2022.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.