REVIEW 2 major objections 4 minor 30 references
Convergence and Stability Analysis of the Extended Infinite Horizon Model Predictive Control
T0 review · 2 major / 4 minor · reviewed 2026-08-12 · deepseek-v4-flash
Pith's one-line read The paper proves that for the extended infinite-horizon MPC and its zone-control variant, the optimal cost converges to zero and the closed loop is uniformly stable for any input horizon and any (possibly singular) static gain matrix.
desk verdict A solid proof extension of the Odloak MPC stability results; the main claim is likely right, but the paper needs a real proof of the load-bearing φ>0 claim before it is complete. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing object is the finite-horizon equivalent of the infinite-horizon cost together with a specially built slack penalty matrix $S$. Because the open-loop system is stable, the infinite sum in $V_k$ collapses to the finite sum (4) with terminal weight $\bar Q$ solving the Lyapunov relation $\bar Q - F^T\bar QF = F^T\Psi^T Q\Psi F$; the terminal constraint $x_s(m-1|k) - \delta_k - r = 0$ keeps the tail bounded. The matrix $\hat S = K_1^T (L^{-1})^T L^{-1} K_1 + K_2^T K_2$, built from an LQ factorization of $D_0^\perp$, is the device that converts output-side slack costs into input-side distances. The other mechanism is the monotonicity lemma (Lemma 2.5), which shows $V_{k+1}^* \le \tilde V_{k+1} \le V_k^*$ by shifting the optimal move sequence forward, and from it the paper derives $\Delta u^*(0|k)\to 0$ and $x_d^*(0|k)\to 0$, the decay facts needed for the contradiction.
What would settle it
For a stable plant with singular $D_0$, choose a rectangle $U$ with a side parallel to the affine set $U_r = u_r + \ker D_0$, and compute $\phi := \inf_{x\in U\setminus\ker D_0}|\cos\theta_x|$. If $\phi = 0$ and the closed-loop simulation from a nonzero steady state shows $\limsup_{k\to\infty}\|u^*(0|k)-P_r u^*(0|k)\| > 0$ (equivalently, $V_k^*$ does not tend to 0) for some horizon $m\ge 2$, the central claim would be false; at minimum such an example would pinpoint the missing hypothesis in Proposition 2.8.
Extended reading notes
Core claim
The central discovery is that a single geometric-algebraic construction removes the two standing restrictions on these controllers. Theorem 2.3 states that under the stability and set-point assumptions one can pick $S = \beta\hat S$ so that $\lim_{k\to\infty} V_k^* = 0$, and Theorem 2.4 derives uniform stability of the output error. The construction of $\hat S$ via the LQ factorization of the restriction $D_0^\perp$ makes $\|D_0 v\|_{\hat S} = \|v\|$ for every input direction $v\in(\ker D_0)^\perp$, so that distances in output space become distances in input space. This reduction permits a contradiction argument in Proposition 2.8: if the implemented input sequence stays away from the reference affine set $U_r = u_r + \ker D_0$, a feasible one-step move toward $U_r$ produces a cost strictly lower than the optimum. The zone-control analog, Theorems 3.3 and 3.4, extends the same mechanism to the formulation with output zones and input targets, with $S_u > H + I_{n_u}$ replacing the condition on $S$.
Load-bearing premise
The proof's convergence argument rests on an unproved geometric assertion that the angle between the direction from any feasible input $x$ to its orthogonal projection onto the target affine set and the direction from $x$ to the closest feasible target point is uniformly bounded away from 90 degrees over the rectangle $U$; if this angle can approach 90 degrees, the bound on the corrective input move collapses.
Editorial extensions
If this is right
- Recursive feasibility and a non-increasing optimal cost hold for any input horizon $m$, so a practitioner can choose longer horizons without losing the Lyapunov-based stability guarantee.
- The explicit choice $S = \beta\hat S$ (with $\beta$ a computable constant) and the zone-control choice $S_u > H + I_{n_u}$ provide concrete tuning rules for the slack weights.
- Systems with non-square or singular static gain can be handled directly, covering plants with more outputs than inputs or with redundant actuator directions.
- The proof templates in Sections 2 and 3 can be adapted to the derived MPC variants mentioned in the introduction (integrating systems, dead time, unstable systems, two-layer RTO-MPC), exactly as the authors claim.
Reading between the lines
- Beyond the paper's claims, the same projection-and-LQ construction may yield closed-form slack weights for robust or invariant-set MPC variants, since the only model-dependent objects are $D_0$, $\Psi$, $F$, and the Lyapunov weight.
- A testable extension not stated in the paper is to allow a set-point sequence $r_k$ that converges geometrically; the proof's estimates suggest the tracking error would inherit the same geometric decay rate.
- The unresolved geometric assertion $\phi>0$ is likely the first point to break in practice: for bounded rectangles it is true whenever the target affine subspace is not parallel to a face, but for unbounded $U$ the claimed uniform bound may fail, and the convergence conclusion would need separate hypotheses.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper analyzes the extended infinite-horizon MPC of Odloak (2004) and the zone-control MPC of González and Odloak (2009). It claims convergence of the optimal cost to zero and uniform stability of the tracking error under a non-regular static gain D0 and for any input horizon m. The proofs use a Lyapunov-type decrease argument, a constructed slack weight S (or Su), and a contradiction argument based on an improved feasible strategy.
Significance. If correct, the results provide the first rigorous convergence and stability proof for these industrially used MPC formulations without requiring D0 to be square or regular, and without restricting the input horizon to m=1. The paper gives explicit constructive conditions on S and Su, and many of the algebraic steps, including the decrease lemmas and the use of stability of F, are checkable and sound. However, the central convergence theorem rests on an unproved geometric claim, and the feasibility arguments for the increment constraints are incomplete.
major comments (2)
- [§2.2, Proposition 2.8] The proof asserts without proof that for a rectangle U, ϕ := inf_{x∈U\kerD0} |cos θ_x| > 0, where θ_x is the angle between Pr x − x and Π_r x − x. This is load-bearing: it is used to bound ‖Δũ(0|k)‖ ≤ αϕ^{-1}(c+ε), and the Appendix defines C3 with a ϕ^{-2} factor. The claim is not a routine consequence of U being a rectangle, because kerD0 is an arbitrary subspace, not necessarily coordinate-aligned. Moreover, U is not stated to be bounded, so the infimum can be approached at infinity. I am not claiming the assertion is false; but as written it is an unproved global transversality/error-bound property. Please supply a proof (for example via recession cones and the positive angle between kerD0 and the relevant faces of U) or add boundedness of U with a compactness-based argument. Without this, the contradiction in Proposition 2.8 and hence Theorem 2.3 is incomplete.
- [§2.2, Proposition 2.8 and §3.2, Theorem 3.3] Feasibility of the constructed increment needs more care. In Proposition 2.8 the strategy sets Δũ(0|k)=α(Π_r u^*(0|k−1)−u^*(0|k−1)) and the text says 'Since U is convex, we can choose α small enough such that this strategy is feasible.' Feasibility also requires Δũ(0|k)∈ΔU, and ΔU is only assumed to be a rectangle containing the origin. If 0 is not in the interior of ΔU, no positive scaling of that vector may be admissible. Since α is later fixed as 3ε/(c+ε), the choice of ε must be coordinated with the size of ΔU. The same issue appears in Theorem 3.3, where (12) uses Δu^*(m−1|k)∈int ΔU and the perturbed increment Δu^*(m−1|k)−(1−α)δ^*_{u,k} is required to lie in ΔU. Please state explicitly that ΔU (and, where needed, U) have nonempty interior containing the origin, or otherwise justify the existence of the required α.
minor comments (4)
- [§2] The convention for x_s(0|k) should be stated explicitly. The equations in Lemmas 2.5 and 2.7 suggest that x_s(0|k) is the state after the first move Δu^*(0|k) has been applied, rather than the measured state before the optimization. With the standard MPC convention, identities such as e_s^*(0|k)−δ_k^* = −D_0∑_{j=1}^{m−1}Δu^*(j|k) would appear inconsistent with (3). Stating the convention would remove ambiguity.
- [Acknowledgements] There are typos in the acknowledgements: 'finantial' should be 'financial'.
- [Appendix] The notation Γ_Z^2 ∨ (2Γ_{\bar Q}Γ_{Z−R}) should define the symbol ∨, or use max, for readers.
- [Abstract] The phrase 'op erate' in the abstract appears to be a broken word from typesetting; please correct in the final version.
Circularity Check
No significant circularity: the proofs are self-contained derivations from the model and cost; the unproved geometric assertion in Proposition 2.8 is a rigor gap, not a circular step.
full rationale
The derivation chain is self-contained. Lemmas 2.5, 2.6, 2.7, 3.5, 3.6, 3.7 and Corollary 3.8 are proved directly from the OPOM state equations (1)-(2), the cost definitions, and the optimization constraints; the results of Odloak (2004) and Gonzalez-Odloak (2009) are re-proved 'for the sake of completeness' (Lemma 2.5, Lemma 3.5), so they are not used as black boxes. The weight matrices are not fitted to data or to the conclusion: Proposition 2.8 constructs S = beta*S-hat with an explicit sufficient condition beta > 6*C3, and Theorem 3.3 requires Su > H + I_nu, both being design inequalities expressed in model parameters; no parameter is estimated from a subset of the convergence/stability data and then 'predicted'. I flag one missing support that is not circular: in the proof of Proposition 2.8, the text asserts 'Since U is a rectangle we have that phi := inf_{x in U excluding ker D0} |cos theta_x| > 0' (Section 2.2), and this bound enters the contradiction argument via ||Delta u_tilde(0|k)|| <= alpha*phi^{-1}(c+epsilon) and the Appendix constant C3 = 2*phi^{-2}[Gamma_Z^2 or (2*Gamma_Qbar*Gamma_{Z-R})]. This is a load-bearing geometric transversality claim about U, ker D0, and the projection Pi_r, and it is not proved; it is a correctness/rigor risk, but it is not a reduction of the theorem to its own inputs. Self-citations are contextual and re-derived, so the circularity score is 0.
Assumptions & free parameters
free parameters (2)
- S (slack weight matrix) =
S = beta * S_hat with beta > 6C3
- Su (zone-control input slack weight) =
Su > H + I_nu
assumptions (5)
- domain assumption Assumption 2.1 (and 3.1): the open-loop system is stable, spectral radius of F is strictly less than 1.
- domain assumption Assumption 2.2: the reference r is reachable, r = D0 u_r for some u_r in U. Assumption 3.2: u_des in U and D0 u_des in Y.
- ad hoc to paper Geometric lemma: for a rectangle U, phi := inf_{x in U \ kerD0} |cos theta_x| > 0, where theta_x is the angle between the orthogonal projection direction onto U_r and the constrained projection direction onto U cap U_r.
- domain assumption U, Delta U and Y are fixed rectangles containing the origin.
- standard math The weight matrices Q, R, S (resp. Qy, Qu, R, Sy, Su) are positive definite, so the cost is strictly convex and the optimizer is unique.
Cite this review
Pith. "Pith review of Convergence and Stability Analysis of the Extended Infinite Horizon Model Predictive Control." pith.science (2026). https://pith.science/paper/YPWMSXGE
@misc{pith2026241114370,
author = {Pith},
title = {Pith review of: Convergence and Stability Analysis of the Extended Infinite Horizon Model Predictive Control},
year = {2026},
howpublished = {\url{https://pith.science/paper/YPWMSXGE}},
note = {Machine review of arXiv:2411.14370}
}
abstract
Model Predictive Control (MPC) is a popular technology to operate industrial systems. It refers to a class of control algorithms that use an explicit model of the system to obtain the control action by minimizing a cost function. At each time step, MPC solves an optimization problem that minimizes the future deviation of the outputs which are calculated from the model. The solution of the optimization problem is a sequence of control inputs, the first input is applied to the system, and the optimization process is repeated at subsequent time steps. In the context of MPC, convergence and stability are fundamental issues. A common approach to obtain MPC stability is by setting the prediction horizon as infinite. For stable open-loop systems, the infinite horizon can be reduced to a finite horizon MPC with a terminal weight computed through the solution of a Lyapunov equation. This paper presents a rigorous analysis of convergence and stability of the extended nominally stable MPC developed by Odloak [Odloak, D. Extended robust model predictive control, AIChE J. 50 (8) (2004) 1824-1836] and the stable MPC with zone control [Gonz\'alez, A.H., Odloak, D. A stable MPC with zone control, J. Proc. Cont. 19 (2009) 110-122]. The mathematical proofs consider that the system is represented by a general gain matrix $D_0$, i.e., not necessarily regular, and they are developed for any input horizon $m$. The proofs are based on elementary geometric and algebraic tools and we believe that they can be adapted to the derived MPC approaches, as well as future studies.
Reference graph
Works this paper leans on
-
[1]
L.A. Alvarez, E.M. Francischinelli, B.F. Santoro, D. Od loak, Stable Model Predictive Con- trol for Integrating Systems with Optimizing Targets, Indu strial & Engineering Chemistry Research 48 (2009) 9141-9150
work page 2009
-
[2]
L.A. Alvarez, D. Odloak, Robust integration of real time optimization with linear model predictive control, Computers and Chemical Engineering 34 (2010) 1937-1944
work page 2010
-
[3]
L.A. Alvarez, D. Odloak, Reduction of the QP-MPC cascade structure to a single layer MPC, Journal of Process Control 24 (2014) 1627-1638
work page 2014
-
[4]
E.F. Camacho, C. Bordons, Model Predictive Control, 2nd Ed., Springer London (2007)
work page 2007
-
[5]
O.L. Carrapiço, D. Odloak, A stable model predictive con trol for integrating processes, Computers and Chemical Engineering 29 (2005) 1089-1099
work page 2005
-
[6]
O.L. Carrapiço, M.M. Santos, A.C. Zanin, D. Odloak, Appl ication of the IHMPC to an industrial process system, IF AC Proceedings Volumes 42 (20 09) 851-856
-
[7]
R.F. de Carvalho, L.A. Alvarez, Simultaneous Process De sign and Control of the Williams- Otto Reactor Using Infinite Horizon Model Predictive Contro l, Industrial & Engineering Chemistry Research 59 (2020) 15979-15989
work page 2020
- [8]
Show all 30 references
-
[9]
González, J.L
A.H. González, J.L. Marchetti, D. Odloak, Extended robu st model predictive control of integrating systems, AIChE Journal 53 (2007) 1758-1769
2007
-
[10]
González, D
A.H. González, D. Odloak, A stable MPC with zone control , Journal of Process Control 19 (2009) 110-122
2009
-
[11]
González, D
A.H. González, D. Odloak, Robust model predictive cont rol for time delayed systems with optimizing targets and zone control. In: A. Bartoszewicz, R obust Control, Theory and Applications, Viena: IntechOpen (2011) 339-370
2011
-
[12]
Keerthi, E.G
S.S. Keerthi, E.G. Gilbert, Optimal infinite-horizon f eedback laws for a general class of constrained discrete-time systems: Stability and moving- horizon approximations, Journal of Optimization Theory and Applications 57 (1988) 265-293
1988
-
[13]
Marques, L.A
F.H. Marques, L.A. Alvarez, Advanced process control s ystem with MPC as a new ap- proach for layer of protection analysis, Journal of Loss Pre vention in the Process Industries 83 (2023) 104993. 21
2023
-
[14]
Martins, D
M.A.F. Martins, D. Odloak, A robustly stabilizing mode l predictive control strategy of stable and unstable processes, Automatica 67 (2016) 132-14 3
2016
-
[15]
Martin, D
P.A. Martin, D. Odloak, F. Kassab, Robust model predict ive control of a pilot plant distillation column, Control Engineering Practice 21 (201 3) 231-241
-
[16]
Martins, A.S
M.A.F. Martins, A.S. Yamashita, B.F. Santoro, D. Odloa k, Robust model predictive con- trol of integrating time delay processes, Journal of Proces s Control 23 (2013) 917-932
2013
-
[17]
Martin, A.C
P.A. Martin, A.C. Zanin, D. Odloak, Integrating real ti me optimization and model pre- dictive control of a crude distillation unit, Brazilian Jou rnal of Chemical Engineering 36 (2019) 1205-1222
2019
-
[18]
Michalska, D.Q
H. Michalska, D.Q. Mayne, Robust receding horizon cont rol of constrained nonlinear sys- tems, IEEE Transactions on Automatic Control 38 (1993) 1623 -1633
1993
-
[19]
Odloak, Extended robust model predictive control, A IChE Journal 50 (8) (2004) 1824– 1836
D. Odloak, Extended robust model predictive control, A IChE Journal 50 (8) (2004) 1824– 1836
2004
-
[20]
de Oliveira, R.F
R.C. de Oliveira, R.F. de Carvalho, L.A. Alvarez, Multi -Model Adaptive Integration of Real Time Optimization and Model Predictive Control, IF AC P apersOnLine 52 (2019) 661-666
2019
-
[21]
Pataro, M.V.A
I.M.L. Pataro, M.V.A. da Costa, B. Joseph. Advanced sim ulation and analysis of MIMO dead time compensator and predictive controller for ethano l distillation process. 12th IF AC Symposium on Dynamics and Control of Process Systems, inclu ding Biosystems (2019) 160-165
2019
-
[22]
I. M. Pataro, J. D. Gil, M.V.A. da Costa, J. L. Guzman, M. B erenguel. A stabilizing predictive controller with implicit feedforward compensa tion for stable and time-delayed systems. Journal of Process Control, (2022), 115, 12-26
2022
-
[23]
Porfírio, D
R. Porfírio, D. Odloak, Optimizing model predictive co ntrol of an industrial distillation column, Control Engineering Practice 19 (2011) 1137-1146
2011
-
[24]
Rawlings, K.R
J.B. Rawlings, K.R. Muske, The stability of constraine d receding horizon control, IEEE Transactions on Automatic Control 38 (1993) 1512-1516
1993
-
[25]
Rodrigues, D
M.A. Rodrigues, D. Odloak, MPC for stable linear system s with model uncertainty. Au- tomatica 39 (2003) 569-583
2003
-
[26]
Santoro, D
B.F. Santoro, D. Odloak, Closed-loop stable model pred ictive control of integrating systems with dead time, Journal of Process Control 22 (2012) 1209-12 18
2012
-
[27]
R.R. Sencio. Model predictive control based on the outp ut prediction-oriented model: a dual-mode approach, and robust distributed algorithms. T ese de Doutorado, Escola Politécnica, Universidade de São Paulo, São Paulo (2022). d oi:10.11606/T.3.2022.tde- 02012023-091805
2022 doi
-
[28]
Silva, B.A
P.M. Silva, B.A. Santana, T.L.M. Santos, M.A.F. Martin s, An implementable stabilizing model predictive controller applied to a rotary flexible lin k: An experimental case study, Control Engineering Practice 99 (2020) 104396. 22
2020
-
[29]
Strutzel
F.A.M. Strutzel. Controle IHMPC de um processo industr ial de hidrotratamento de diesel. Dissertação de Mestrado, Escola Politécnica, Universidad e de São Paulo, São Paulo (2014). doi:10.11606/D.3.2014.tde-24062014-102335
2014 doi
-
[30]
Strutzel, D
F.A.M. Strutzel, D. Odloak, A.C. Zanin, Economic MPC of an Industrial Diesel Hy- drotreating Plant, Proceedings of the IASTED Internationa l Conference, Intelligent Sys- tems and Control (2013) 354-360. DOI: 10.2316/P.2013.807- 022. 23
2013 doi
Reviewed August 12, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.