Pith. sign in

REVIEW 2 major objections 6 minor 1 cited by

A Minimax Optimal Controller for Positive Systems

T0 review · 2 major / 6 minor · reviewed 2026-08-09 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A minimax optimal control problem for positive systems is solved explicitly by a linear program, with optimal linear feedback.

desk verdict Clean, plausible reduction of minimax to disturbance-free minimization for positive systems, but the theorem as stated misses an LP-boundedness condition that a simple counterexample exposes. read the letter →

arxiv 2502.01180 v2 pith:CXRFZWID submitted 2025-02-03 math.OC cs.SYeess.SY

Alba Gurpegui , Emma Tegling , Anders Rantzer This is my paper · ORCID
classification math.OCcs.SYeess.SY MSC 93C5593B5290C0549L20
keywords minimaxoptimalcontrolpositivesystemsBellmanequationlinearprogrammingdisturbancepenaltyfeedbacksparsityrobust
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper asks when a worst-case optimal control problem for positive linear systems—systems whose state stays nonnegative—has a finite solution when disturbances are unconstrained and adversarial. It establishes an if-and-only-if condition: the problem has a finite minimax value exactly when the disturbance penalty vector $\gamma$ satisfies $\gamma \geq F^{\top}p$, where $p$ comes from an explicit linear program. When this condition holds, the optimal value is $p^{\top}x_0$ and the optimal controller is a linear feedback law $u = -Kx$, so no nonlinear policy can do better. The result matters because it turns a robust game-theoretic control problem into a tractable linear program with a controller whose sparsity structure is prescribed by the constraint matrix $E$.

What carries the argument

The argument is carried by three pieces. First, the elementwise inequality $A \geq |B|E$ keeps trajectories in the nonnegative orthant under all admissible controls and nonnegative disturbances, so the state space $\mathbb{R}^n_+$ is invariant. Second, a linear value function $J^*(x)=p^{\top}x$ is substituted into the Bellman equation, reducing the minimax problem to the linear program (5) whose solution $p$ and auxiliary variable $\zeta$ produce the disturbance-penalty threshold $F^{\top}p$. Third, the optimal control is chosen pointwise from the sign of $r_i^{\top} + p^{\top}B_i$, which yields the linear feedback matrix $K$ with rows $\operatorname{sign}(r_i^{\top} + p^{\top}B_i)E_i$ and therefore inherits the sparsity pattern of $E$. A supporting lemma from earlier work by the same authors supplies the equivalence between finite value, convergence of value iteration, and existence of a nonnegative Bellman solution, which is what turns these pieces into an if-and-only-if proof.

What would settle it

Take the double-tank example in the paper with $\gamma = 1.0$, below the computed threshold $F^{\top}p \approx 1.32$, and run value iteration on a long finite horizon for problem (8): if the worst-case value remains bounded as the horizon grows, the if-and-only-if statement of Theorem 1 is false. Alternatively, keep $\gamma$ above the threshold and search numerically over nonlinear periodic policies for a value below $p^{\top}x_0$, which would disprove optimality of the linear law.

Watch

Extended reading notes

Core claim

The central claim is Theorem 1: for discrete-time positive systems $x(t+1)=Ax(t)+Bu(t)+Fw(t)$ with $w\geq 0$, running cost $s^{\top}x + r^{\top}u - \gamma^{\top}w$, and control constraint $|u|\leq Ex$, the assumptions $A \geq |B|E$ and $s > E^{\top}|r|$ imply that the minimax problem has a finite value for every $x_0\in\mathbb{R}^n_+$ if and only if $\gamma \geq F^{\top}p$, where $p$ solves the linear program maximizing $\mathbf{1}^{\top}p$ subject to $p \leq s + A^{\top}p - E^{\top}\zeta$ and $|r + B^{\top}p| \leq \zeta$. Under that condition the optimal value equals $p^{\top}x_0$ and the optimal policy is linear, with row $i$ of $K$ equal to $\operatorname{sign}(r_i^{\top} + p^{\top}B_i)E_i$. A direct corollary is that, whenever a finite solution exists, the worst-case disturbance problem collapses to the disturbance-free minimization problem, and $\gamma \geq F^{\top}p$ is exactly the threshold on the disturbance penalty that makes the game finite.

Load-bearing premise

The whole result rests on the elementwise inequality $A \geq |B|E$, which guarantees the state never leaves the nonnegative orthant under any admissible control and nonnegative disturbance; if that inequality fails, the linear value-function proof and the LP characterization no longer apply.

Editorial extensions

If this is right

  • Any control policy, including nonlinear and nonsparse ones, achieves worst-case cost no lower than the linear policy $u=-Kx$.
  • Below the threshold $\gamma < F^{\top}p$, no controller can make the worst-case cost finite; at or above it, the closed loop is positively asymptotically stable with performance level $\gamma$.
  • The sparsity structure chosen through $E$ is preserved exactly in the optimal gain $K$, so large-scale control constraints can be designed up front and solved by linear programming.
  • When the threshold is met, minimax control of positive systems is no harder than disturbance-free linear-cost control, so existing linear-programming solvers apply.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Implicit in the proof is a reading of $\gamma \geq F^{\top}p$ as an induced-gain condition; one could test numerically how far it is from necessary when the invariance condition $A \geq |B|E$ is violated but states spend only a little time outside the orthant.
  • The linear-value-function approach suggests a continuous-time analogue for Metzler matrices, with the linear program replaced by a suitable linear program or linear matrix inequality; the paper flags the continuous setting as ongoing rather than proving it.
  • A finite-horizon version of the problem would likely have finite value for any $\gamma$, with the threshold pinning down when the infinite-horizon limit stays finite; this could be checked by value iteration on the double-tank example for $\gamma$ below the bound.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 6 minor

Summary. This paper studies the discrete-time, infinite-horizon minimax optimal control problem (1) for positive systems with nonnegative state, componentwise control constraint |u| ≤ Ex, and nonnegative disturbance w with no upper bound. The main result (Theorem 1) states that, under conditions (2) and (3), the problem has a finite value for every initial state x0 ∈ R^n_+ if and only if the disturbance penalty γ satisfies γ ≥ F^T p, where p is obtained from the linear program (5); in that case the value is p^T x0 and an optimal policy is the linear feedback u = -Kx with K given by (7). The proof outline argues via a dynamic-programming lemma from prior work that, under condition (4), the worst-case disturbance is attained at w = 0, so the minimax problem reduces to the corresponding disturbance-free minimization problem.

Significance. If correct, the result gives an explicit, computationally tractable LP characterization of the value function and of an optimal sparse linear controller for a class of robust positive-system problems, extending the authors' earlier constrained-disturbance result. The specific contribution is identifying the threshold condition (4) under which unconstrained disturbances do not increase the worst-case cost, so that the minimax value coincides with the L1-optimal control value. The double-tank example illustrates the design procedure. However, as detailed in the major comments, the theorem currently lacks a well-posedness condition for the LP (5), and the proof is only a sketch. These issues are load-bearing and must be resolved before the central claims are fully supported.

major comments (2)
  1. [Section 2, Theorem 1 and LP (5)] The theorem states that the problem has finite value iff γ ≥ F^T p, where p is obtained by solving (5), but it does not ensure that (5) has a finite optimum. Under the stated assumptions (2)–(3), the LP can be unbounded. For example, let n=m=l=1, A=1, B=0, F=1, E=0, s=1, r=0. Then (2) and (3) hold, and the constraints of (5) reduce to p ≤ 1+p and ζ ≥ 0, so every p ≥ 0 is feasible and maximize 1^T p is unbounded. At the same time, problem (1) has infinite value for every x0 > 0: even with w=0, the state remains x(t)=x0 and the cumulative cost Σ_{t=0}^∞ x0 diverges. Thus the phrase 'where p is obtained solving the linear program' is undefined in an admissible instance, and the 'if and only if' claim cannot be applied. The theorem should be amended to include a boundedness/well-posedness condition for the LP, or to state explicitly that an unbounded LP corresponds to no finite value, with a proof of that correspondence.
  2. [Proof of Theorem 1] The proof is explicitly only an outline: the text says 'In this extended abstract we only provide an outline of the proof.' The statements 'use induction over p_k^T x = J_k(x) ... to prove the equivalence' and 'use the equivalences in Lemma 5 to deduce the bound (4)' are not backed by a full induction or explicit derivations. In particular, the 'only if' direction requires showing that a finite value for (1) implies both that (5) has a finite optimal solution and that (4) holds; the outline does not address this. Since these omitted steps are the bridge between the minimax problem and the LP, a complete proof is necessary for a journal publication.
minor comments (6)
  1. [References] The reference to 'Hansson and Boydt (1998)' should be 'Hansson and Boyd'.
  2. [Author byline] The second author's name appears as 'Emma T egling' with an extra space; it should be 'Emma Tegling'.
  3. [Remark 3] Remark 3 is cryptic: 'The result in Theorem 1 is analogous for w < 0 and γ < F^T p respectively.' Since the problem is formulated only for w ≥ 0, the remark needs to define the modified problem for w < 0 and clarify what 'respectively' refers to.
  4. [Problem setup, Eq. (1)] The constraint '|u| ≤ Ex' should be written componentwise (e.g., |u_i| ≤ E_i x for i=1,...,m) to avoid ambiguity, since E is a matrix.
  5. [Abstract and Introduction] The phrase 'unconstrained disturbances' is used, but the problem has w ≥ 0 with no upper bound; the wording 'unbounded nonnegative disturbances' would be more precise.
  6. [Example, Section 3] The example says 'the disturbance and the control action are equally characterized, because a large-scale example cannot be tractably represented'; this sentence is unclear and should be rewritten.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the disturbance-penalty threshold γ ≥ F^T p is derived from the Bellman equation, not imposed by construction.

full rationale

The derivation chain does not reduce to its inputs. Theorem 1's characterization is obtained by inserting the candidate linear value function p^T x into the Bellman equation (12): the inner maximization over w ≥ 0 has a finite value only if the coefficient (p^T F - γ^T) is nonpositive, which is exactly condition (4), and when (4) holds the maximizer is w = 0, so the minimax problem reduces to the disturbance-free linear-programming problem (5), yielding p^T x0 and the linear feedback (7). The vector p is not a fitted parameter renamed as a prediction; it is the value function of the associated minimization problem and is computed independently of the target minimax value. The proof does rely on Lemma 5 from the authors' prior work, but Lemma 5 is a general, parameter-free dynamic-programming equivalence whose stated assumptions (max_w g ≥ 0, guaranteed by conditions (2)-(3)) do not include the theorem's conclusion and whose content is not identical to the claimed result. The proof is abbreviated and Theorem 1 as written omits an explicit feasibility/boundedness caveat for the LP (5), but that is a well-posedness or correctness gap, not a circular step. No equation or fitted value is equivalent by construction to the claimed minimax optimal value or threshold.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The central claim introduces no new entities or fitted parameters. It rests on the authors' prior lemma, the two structural inequalities (2) and (3), and the implicit well-posedness of the LP.

assumptions (4)
  • domain assumption Lemma 5 equivalence between finite value, recursive sequence, and Bellman equation for general minimax problems
    Stated in the Appendix, proof deferred to Gurpegui et al. (2023); the main proof builds on this equivalence.
  • domain assumption A ≥ |B|E (elementwise), condition (2)
    Ensures positive-orthant invariance under any admissible control and w ≥ 0; used to keep states in R^n_+ so the linear value function applies.
  • domain assumption s > E^T |r| (elementwise), condition (3)
    Guarantees max_{w≥0} g(x,u,w) ≥ 0 for all x ∈ R^n_+, u ∈ U(x), a hypothesis of Lemma 5.
  • domain assumption The LP (5) has a finite optimum and the optimal p is used in the threshold
    The theorem states 'p is obtained solving the linear program (5)' but does not discuss feasibility, boundedness, or uniqueness of p; these are implicit.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A Minimax Optimal Controller for Positive Systems." pith.science (2026). https://pith.science/paper/CXRFZWID

@misc{pith2026250201180,
  author       = {Pith},
  title        = {Pith review of: A Minimax Optimal Controller for Positive Systems},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/CXRFZWID}},
  note         = {Machine review of arXiv:2502.01180}
}
read the original abstract

We present an explicit solution to the discrete-time Bellman equation for minimax optimal control of positive systems under unconstrained disturbances. The primary contribution of our result relies on deducing a bound for the disturbance penalty, which characterizes the existence of a finite solution to the problem class. Moreover, this constraint on the disturbance penalty reveals that, in scenarios where a solution is feasible, the problem converges to its equivalent minimization problem in the absence of disturbances.

Figures

Figures reproduced from arXiv: 2502.01180 by the authors.

Figure 1
Figure 1. Double Tank process with disturbance w. x(k + 1) = Ax(k) + Bu(k) + F w(k) where A =  0.9648 0 0.0345 0.9648 ; B = F =  0.0971 0.0017 . Let γ ≥ F ⊤p, E = [1 0], s = [1 1] ⊤ and r = 0.2. Now, we formulate the optimal control problem (1) accordingly as: inf µ max w X∞ t=0 [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Minimax adaptive control for finite sets of positive linear systems

    math.OC 2026-07 accept novelty 6.0 of 10

    Explicit minimax adaptive policies stabilize finite sets of positive LTI plants under adversarial disturbances with certified ℓ1-gain, via a history-variable Bellman inequality.

Reference graph

Works this paper leans on

25 extracted references · 23 canonical work pages · cited by 1 Pith paper

  1. [1]

    , " * write output.state after.block = add.period write newline

    ENTRY address author booktitle chapter doi edition editor eid howpublished institution journal key month note number organization pages publisher school series title type url volume year label extra.label sort.label short.list INTEGERS output.state before.all mid.sentence after.sentence after.block FUNCTION init.state.consts #0 'before.all := #1 'mid.sent...

  2. [2]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in bbl.in capitalize " " * FUNCT...

  3. [3]

    and Farina., L

    Benvenuti, L. and Farina., L. (1996). Discrete-time filtering via charge routing networks. Signal Processing, 49(3), 207--215

    work page 1996

  4. [4]

    and Farina, L

    Benvenuti, L. and Farina, L. (2001). The design of fiber-optic filters. Journal of Lightwave Technology, 19(9), 1366--1375

    work page 2001

  5. [5]

    Benvenuti, L., Farina, L., and Anderson, B. (2001). The positive side of filters: a summary. IEEE Circuits and Systems Magazine, 1(3), 32--36

    work page 2001

  6. [6]

    and Plemmons, R

    Berman, A. and Plemmons, R. (1979). Nonnegative matrices in the mathematical sciences. Academic Press

    work page 1979

  7. [7]

    Blanchini, F., Bolzern, P., Colaneri, P., De Nicolao , G., and Giordano, G. (2023). Optimal control of compartmental models: The exact solution. Automatica, 147, 110680

    work page 2023

  8. [8]

    Blanchini, F., Colaneri, P., and Valcher, M. (2015). Switched Positive Linear Systems. Now Foundations and Trends

    work page 2015

Show all 25 references
  1. [9]

    and Giordano, G

    Blanchini, F. and Giordano, G. (2014). Piecewise-linear L yapunov functions for structural stability of biochemical networks. Automatica, 50, 2482–2493

    2014

  2. [10]

    and Cobelli, C

    Carson, E. and Cobelli, C. (2001). Modelling Methodology for Physiology and Medicine. Biomedical engineering. Academic Press, San Diego

    2001

  3. [11]

    and Shapiro., H

    Coxson, P. and Shapiro., H. (1987). Positive reachability and controllability of positive systems. Linear Algebra and its Applications, 94, 35–53

    1987

  4. [12]

    (2017 a )

    Ebihara, Y., Peaucelle, D., and Arzelier, D. (2017 a ). Analysis and synthesis of interconnected positive systems. IEEE Trans. Automatic Control, 62, 652--667

    2017

  5. [13]

    (2017 b )

    Ebihara, Y., Peaucelle, D., and Arzelier, D. (2017 b ). Steady-state analysis of delay interconnected positive systems and its application to formation control. IET Control Theory and Applications, 11, 2783 – 2792

    2017

  6. [14]

    Gurpegui, A., Tegling, E., and Rantzer, A. (2023). Minimax linear optimal control of positive systems. The IEEE Control Systems Letters (L-CSS), 7, 3920--3925

    2023

  7. [15]

    and Chellaboina., V

    Haddad, W. and Chellaboina., V. (2005). Stability and dissipativity theory for nonnegative dynamical systems: A unified analysis framework for biological and physiological systems. Nonlinear Analysis: Real World Applications, 6(1), 35–65

    2005

  8. [16]

    Haddad, W., Chellaboina, V., and Hui., Q. (2010). Nonnegative and Compartmental Dynamical Systems. Princeton University Press

    2010

  9. [17]

    and Boydt, S

    Hansson, A. and Boydt, S. (1998). Robust optimal control of linear discrete-time systems using primal-dual interior-point methods. 1998 American Control Conf. (ACC), 1, 183--187

    1998

  10. [18]

    Hernandez-Vargas, E., Middleton, R., Colaneri, P., and Blanchini, F. (2011). Discrete-time control for switched positive systems with application to mitigating viral escape. International Journal of Robust and Nonlinear Control, 21(10), 1093--1111

    2011

  11. [19]

    and Middleton., R

    Hernandez-Vargas, E. and Middleton., R. (2013). Modelling the three stages in HIV infection. Journal of Theoretical Biology, 320, 33--40

    2013

  12. [20]

    Jacquez, J. (1974). Compartmental analysis. Biology and medicine. Biometrische Zeitschrift, 16(8), 537--537

    1974

  13. [21]

    Luenberger, D. (1979). Introduction to Dynamic Systems. Theory, Models, and Applications. Academic Press

    1979

  14. [22]

    Moreno, Y., Pastor-Satorras, R., and Vespignani., A. (2013). Epidemic outbreaks in complex heterogeneous networks. The European Physical Journal B - Condensed Matter and Complex Systems, 26(4), 521–529

    2013

  15. [23]

    Nieuwenhuis, J. (1986). Some results about a Leontieff-type model . In C.I.Byrnes and Lindquist A, editors, Frequency domain and State space methods for Linear Systems. Elsevier Science, 213–225

    1986

  16. [24]

    Rantzer, A. (2022). Explicit solution to B ellman equation for positive systems with linear cost. 2022 IEEE 61st Conference on Decision and Control (CDC), 7, 6154--6155

    2022

  17. [25]

    Smith, H.L. (1995). Monotone Dynamical Systems: An Introduction To The Theory Of Competitive And Cooperative Systems, volume 41. AMS, Mathematical Surveys And Monographs

    1995

Pith tools

Reviewed August 9, 2026 · model on record in the stance chip above.