Pith.

Optimization and Control · arXiv:2611.17221 v1 · submitted 12 Nov 2026 · 31 references

FanCyqlone: A Parallelized Solver for Multi-Horizon Optimal Control

Matisse Teuwen, Pieter Pas, Mathijs Schuurmans, Panagiotis Patrinos

The paper says

“Multi-horizon optimal control aims to select optimal control sequences simultaneously for several possible future scenarios, ensuring consistency at the first stage.”

more of the abstract

While this enables advanced model predictive control schemes that explicitly handle prediction uncertainty, solving these problems tends to be costly. We introduce FanCyqlone, a linear solver that exploits parallelism across both time steps and scenario branches. The method builds on Cyqlone to compute the contribution of each branch and combines these results through a shared root problem. We integrate FanCyqlone into QPALM to develop FanCyQPALM, a solver for multi-horizon optimal control problems with general linear stage-wise constraints. We compare its performance with state-of-the-art solvers on spring-mass and quadruped control benchmarks.

from the abstract

Pith says

Machine review · deepseek-v4-flash · 13 Nov 2026 · what was read was not recorded · not checked by a person

It can be wrong. Challenge this review or reply to it.

Holds up, with conditions. Sound branch-parallel extension of Cyqlone to multi-horizon KKT systems — the load-bearing lemma is cited from their own unpublished preprint, but it is classical and the proof skeleton is there, so treat it as a hygiene issue, not a correctness risk; send to review. This line is wrong

3 major objections · 4 minor

How often objections from reviews like this one are right: not yet measured

Are you an author? What you can do.

Not checked: figures, code, what the 31 references say.

The paper says, at Section I and II-A

The review did not quote this passage.

Pith says: Objection 1 of 3 · major

The load-bearing step is the asserted equivalence between dynamic-programming elimination and Schur-complement elimination in Cyqlone's factorization, cited as [12, Sec. 9.2] from a same-group arXiv-only preprint. The Appendix supplies the quotient-rule and permutation-invariance arguments that connect this equivalence to the augmented problem, but it does not justify the underlying equivalence for the permuted, batch-wise factored branch KKT matrices.

more of objection 1

Since the proof of Proposition II.1 is the only thing the solver's correctness rests on beyond standard Schur-complement manipulations, the paper should either state the precise form of [12, Sec. 9.2] (including its hypotheses on augmentation and permutation), or include a self-contained proof. As written, the argument 'eliminating via DP and via Schur complements are equivalent' is asserted for the augmented problem and the identity L0,j = L_Pj then follows only to the extent that the cited lemma covers Cyqlone's exact elimination order.

The paper says, at Section III, FanCyQPALM

The review did not quote this passage.

Pith says: Objection 2 of 3 · major

The step from the primal factorization (Algorithm 1) to the semismooth Newton systems relies on the generalized Hessians H^ and R^0 having the same sparsity structure as the LQR KKT blocks. This is stated briefly in Section III and the generalized Hessian formulas are given, but the paper does not show explicitly that Proposition II.1 continues to apply with these …

more of objection 2

… modified diagonal blocks, in particular that the bottom-right block of the factored augmented branch KKT matrix remains the Cholesky factor of (P̂_j)^{-1} with P̂_j now the Riccati result for the regularized Hessians. Although this is a benign structural observation, it is load-bearing for the claim that the inner Newton systems are solved by exactly the same L0,j-extraction procedure. A one-line argument in Section III would close the gap.

The paper says, at Section IV, numerical experiments

The review did not quote this passage.

Pith says: Objection 3 of 3 · major

The benchmark comparison is careful in several respects, but the reported speedups are software-version-dependent, and the paper does not report the exact versions or commits of PIQP, treeQP, and Hpipm used, nor the full list of solver settings beyond the disclosed adjustments (t0_init=0, complementarity tolerance 10^-6, duality-gap disabled, initial_inner_tolerance).

more of objection 3

Given that the paper already discloses these adjustments, adding a version table or a reproducibility script would strengthen the claim that the benchmarks reflect the current state of the art rather than just the configuration used here.

4 minor objections

The paper says, at Notation and Section II-A

Pith says: minor objection 1 of 4

The notation for P_j^{-1} is used before its Cholesky factorization is defined; in F1, the factor L_Pj is introduced only after P_j was defined in Eq. (4). Define L_Pj directly after Eq. (4) for readability.

The paper says, at Proposition II.1

Pith says: minor objection 2 of 4

The statement 'L0,j = L_Pj' should specify that the equality holds for the positive Cholesky factor; the LDL^T form in Eq. (7) has D = -I, so the positive factor L0,j is the one meant. This is clear from the proof but should be stated in the proposition for clarity.

show 2 more

The paper says, at Section II-C3 and Remark 1

Pith says: minor objection 3 of 4

The claim that A0j, Q0j and S0j are not accessed because Cyqlone eliminates the initial state is correct for the augmented problem, but the paper should note explicitly that this is why the root problem's S0j x_initj term is handled separately in Algorithm 2 (line 7); a reader may otherwise wonder whether the root term is double-counted.

The paper says, at Figures 2-6

Pith says: minor objection 4 of 4

The figures' captions do not state whether the boxplots show medians, 25/75 percentiles, or min/max whiskers, nor how many runs per boxplot other than 'median of ten solves'. Add a sentence in each caption or in Section IV defining the boxplot elements.

What would settle it

Verify Proposition II.1 numerically in the exact regime used by the solver. For random instances (stages k=0..N-1 with A,B,Q∈S++,R∈S++, S,f,q,r drawn from a fixed distribution; nx∈{3,10,30}, nu∈{2,5}, N∈{10,50,200}, J=1): (i) compute P_j,p_j by the standard Riccati recursion for problem (3); (ii) run Cyqlone's factorization and forward solve (as in Algorithms 1-2) on the augmented problem (8) with x = f̃0j; (iii) check ‖L0,j L0,j^T − P_j^{-1}‖/‖P_j^{-1}‖ < 1e-10 and ‖L0,j λ̂0j − (f̃0j + P_j^{-1}p_j)‖ < 1e-8. If both hold across the full random family, the [12, §9.2] equivalence is confirmed in the augmented/permuted setting and the concern is resolved; if any instance fails, the root-combination scheme is invalidated. This uses only the existing open-source code and requires no new theory, targeting the exact hinge.

from the skeptic's reading

How the review went

4 readings by deepseek-v4-flash · 13 Nov 2026

  1. Reader holds up, with conditions confidence moderate
  2. Skeptic agrees 1 min 3 s · 15,248 tokens read, 9,338 written
  3. Editor wrote the verdict above 16 s · 16,389 tokens read, 2,305 written
  4. Referee major revision: 3 major objections, 4 minor 24 s · 15,807 tokens read, 3,538 written

Not run on this paper: the simulated authors' defence.

Pith did not check this review's objections against the paper.

The review in full

The review in brief, machine-written

Short version: this is a genuine, clean extension of the group's own Cyqlone solver to multi-horizon KKT systems, and the core identity holds up. It deserves a serious referee. My main reservation is moderate and it is about sourcing, not math: the load-bearing DP/Schur-equivalence lemma is cited from the same group's arXiv-only preprint [12, §9.2] instead of derived here.

What is actually new: FanCyqlone extracts each branch's value-function factor L0,j directly from Cyqlone's block-Cholesky factorization of an augmented branch problem, then combines branch contributions in a reduced root system. That trick avoids a separate Riccati recursion per branch and works on indefinite KKT systems, which the concurrent GPU solver [8] cannot handle. The appendix proof of Proposition II.1 is largely complete: the Schur-complement identity (10), the Kfirst setup (12), and the final step via the quotient rule and permutation invariance all checked out when I followed them. The derivation uses no fitted parameters, and the benchmarks are disclosed honestly — the HPIPM tolerance relaxations, the PIQP duality-gap disable, the quadruped R regularization, and the spring-mass crossover at large M where they concede treeQP. That is good discipline.

Soft spots, in proportion. The stress-test note flags the one-line quote of [12, §9.2] as the single most consequential gap. I read it as real but modest: the DP/Schur equivalence is classical — Riccati recursion is block Gaussian elimination on the same KKT matrix — and the appendix already supplies the permutation-invariance and quotient-rule justification for the rest of the chain. Low risk. But citing your own unpublished preprint for an identity the whole method leans on is a fair referee objection even when the result is true, and the fix is easy: restate or derive the equivalence inside the appendix. Two minor items: the code ships without a commit hash, and the coupled-only-at-first-stage scope (robust horizon one) is stated openly but is a real boundary against deeper trees.

For whom: people working on multi-horizon and contingency MPC solvers on CPUs, and anyone benchmarking scenario-MPC tooling. It is not a deep theoretical result, and it is a narrow engineering speedup within an established class — but it is a real one, with open source code and externally checked residuals.

Recommendation: send it to peer review. Ask for the lemma derivation and a commit hash; do not hold the method hostage to them. My own confidence in the central claim is higher than the reader's — everything except that one citation is on the table and standard.

The strongest objection

The central identity Proposition II.1 (L0,j L0,j^T = P_j^{-1} and L0,j λ̂0j = x + P_j^{-1} p_j) is what lets FanCyqlone extract each branch's value-function factor directly from Cyqlone's factorization of the augmented problem (8) and combine branch contributions in the reduced root system (F1–F5, S1–S5). If that identity fails, the root combination — which builds L_Bj = B0j^T L0j^{-T} and the reduced root Hessian R = R0 + Σ_j S_Bj — produces the wrong first-stage solve, and the benchmarked method collapses. The paper's proof is otherwise complete and standard: the augmented problem (8) has value function V_j(x1) equal to the original (3) since the dummy input appears only in its own cost ½‖ũ0‖², so ũ0 = 0 at the optimum; the Kfirst system (12), the Schur complements (10) and (15) agreeing with L0L0^T = −K_Cyq/(Π1KΠ1^T) and with (−P^{-1}, −P^{-1}p−x), and the uniqueness-of-Cholesky step giving L0 = L_P all check out. The single external step is the assertion 'Elimination using dynamic programming and Schur complements are equivalent [12, §9.2]', cited, not derived, from the same group's arXiv-only preprint (arXiv:2512.09058v2). The equivalence is classical in the un-augmented setting, but here it must survive (i) the dummy-state/dummy-input augmentation of (8) with its extra nx+nu blocks and R̃0 = I, and (ii) Cyqlone's permutation [12, §4.1] placing the x1 = x constraint block last in each branch's KKT matrix. Both are benign in principle — permutation invariance and the quotient rule for Schur complements are standard — but that is precisely what the proof asserts rather than demonstrates at the hinge. Because [12] is not peer-reviewed and shares authorship, the load-bearing lemma lacks independent confirmation; this is the single most consequential gap.

The reader's weakest_assumption — the DP/Schur-equivalence lemma from [12, Sec. 9.2], cited from the same group's arXiv preprint and not re-derived — is exactly the hinge I identify; agreement is full. I read the rest of the argument in good faith and found it sound: the augmentation is benign (the dummy input enters only ½‖ũ0‖² so it vanishes at the optimum and V_j(x1) equals the value function of the original tail problem (3)); the Kfirst system (12) and the Schur complements (10) and (15) are correct, including the signs and the uniqueness-of-Cholesky step giving L0 = L_P. The whole scheme therefore reduces to one cited, unverified lemma, invoked in a single line of the Appendix proof. Per the review rules, attacking a cited result is legitimate when the source is an unpublished same-group arXiv preprint rather than a peer-reviewed publication, and when the result is used outside a stated hypothesis or with added structure — here the dummy augmentation and Cyqlone's permutation are exactly the added structure. The concern is real but modest: the equivalence is classical, and both the augmentation and the permutation are benign in principle, so the most likely outcome of the proposed numerical check is confirmation. That does not overturn the reader's verdict; rather, it sharpens the justification for CONDITIONAL: the authors should supply an independent derivation or restatement of the [12, §9.2] lemma (or the numerical confirmation above) before the speedup claims are taken at face value. The disclosed per-solver tolerance adjustments (Hpipm complementarity relaxed to 1e-6, PIQP duality-gap check disabled) and the spring-mass crossover where treeQP wins are secondary relative to the correctness hinge; they are honestly reported and do not change my assessment. I therefore keep the verdict UNCHANGED.

The referee's report

If the central identity is correct, the paper makes a genuine contribution: it gives a clean way to extract per-branch value-function factors from a parallel factorization of an augmented branch KKT system, avoiding a separate Riccati recursion, and it provides an open-source SPMD implementation with reproducible benchmarks. Strengths include the explicit algorithmic presentation (Algorithms 1-2), a proof of the main structural identity that reduces the external dependency to one cited equivalence, disclosed per-solver tuning choices (initial_inner_tolerance, t0_init=0, complementarity tolerances), external residual checking, and open-source code. The claimed advantage over GPU-based approaches for the moderate-number-of-scenarios regime is plausible. The central claim is a mathematical identity plus a benchmark; the derivation itself has no fitted parameters, so the speedup claims are falsifiable.

Pith's reading of the paper (a machine's summary, not the authors')

This paper introduces FanCyqlone, a CPU-based linear solver for the KKT systems that arise in multi-horizon optimal control problems, where multiple future scenarios (branches) are coupled only at the first stage. The method exploits parallelism across both time steps and scenario branches by computing each branch's contribution directly from Cyqlone's parallel factorization of an augmented branch problem, combining those contributions in a reduced root system, and then recovering branch solutions through parallel back-substitution. If correct, FanCyqlone enables the solver FanCyQPALM to achieve substantial speedups over state-of-the-art solvers on benchmarks with spring-mass systems and quadruped control, especially when the number of branches is modest (e.g., 2 to 8) and the horizon length is long. The paper's central object is a block-Cholesky factorization identity that connects Cyqlone's output to the per-branch value-function factors, eliminating the need for a separate Riccati recursion. A sympathetic reader would care because this work addresses a computational bottleneck in model predictive control under uncertainty, where solving for multiple scenarios is often too expensive for real-time applications.

What carries the argument. The key machinery is the block-Cholesky factorization identity in Proposition II.1: for each branch j, the bottom-right n_x-by-n_x block L_{0,j} of the Cholesky factor of Cyqlone's permuted KKT matrix for the augmented branch problem equals the Cholesky factor of $P_j^{{-1}}$, where P_j is the value-function Hessian from dynamic programming. This identity allows the algorithm to extract the per-branch value-function factors directly from Cyqlone's output, eliminating the need for a separate Riccati recursion. The root problem's factorization and solve then combine these contributions via a Schur complement of the branch-level factors.

Core claim. The paper claims that the KKT system of a multi-horizon LQR problem can be solved by (i) augmenting each branch problem with a dummy initial state and input, (ii) applying Cyqlone's parallel-in-time factorization and forward solve to each augmented branch, (iii) extracting the bottom-right n_x-by-n_x block of each branch's Cholesky factor (which equals the Cholesky factor of the inverse value-function matrix $P_j^{{-1}}$), (iv) combining these branch contributions into a reduced root system, and (v) recovering all branch solutions via parallel backward substitution. The load-bearing identity is Proposition II.1: the bottom-right block L_{0,j} of Cyqlone's factor satisfies L_{0,j} L_{0,j}^T = $P_j^{{-1}}$ and L_{0,j} = L_{P_j}, so no separate Riccati recursion is needed to obtain the per-branch value-function factors. The paper further integrates FanCyqlone into the proximal augmented Lagrangian solver QPALM to handle general linear stage-wise constraints, yielding FanCyQPALM.

The premise it rests on. The correctness of FanCyqlone rests on the lemma, cited from the Cyqlone paper [12] and not re-derived here, that eliminating states via dynamic programming is equivalent to eliminating them via Schur complements in Cyqlone's block-Cholesky factorization of the augmented branch problem, and that this equivalence survives the dummy-state augmentation and Cyqlone's permutation of the KKT matrix.

If the paper is right (Pith's inferences, not the authors')

FanCyQPALM can solve multi-horizon LQR problems with general linear constraints faster than existing solvers (Hpipm, treeQP, PIQP) on CPU for typical problem sizes (horizon lengths 64–256, branches 2–8, state dimension up to 60).

The two-level parallelism (over branches and over time) gives consistent speedups over single-level parallelism (time only) when the number of branches exceeds one.

The method handles indefinite KKT systems (arising from equality constraints in augmented Lagrangian or interior-point methods), unlike GPU-based direct solvers that require positive definite matrices.

FanCyQPALM's open-source implementation (C++ with Python bindings) makes the method accessible for real-time MPC applications with modest numbers of scenarios.

The paper's reliance on Cyqlone's factorization order suggests that the method is tied to the specific elimination order of Cyqlone; adapting FanCyqlone to other parallel-in-time solvers would require re-deriving the identity in Proposition II.1 for that solver's permutation.

The benchmark results show a crossover where treeQP becomes faster for large state dimensions (M > 22) in the spring-mass problem, hinting that FanCyqlone's advantage may diminish for problems where the per-stage cost Hessians are diagonal and constraints are simple boxes, as treeQP exploits those structures more directly.

The paper does not test FanCyQPALM on GPU hardware; given the CPU focus, a natural extension would be to port the branch-level computations to GPU for larger numbers of branches, though the authors note that GPU overheads currently outweigh benefits for modest branch counts.

The method's restriction to a single shared root stage (robust horizon one) limits its applicability to deeper scenario trees; extending the approach to deeper trees would require a recursive application of the root-combination scheme.

Check this review

Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.

How often reviews like this one are right

Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.

How often objections from reviews like this one are right: not yet measured

Every value above, in the review's public record (JSON)

Reviews by people

This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.

Request a human review

How Pith checks papers · The full audit of this paper

The paper

Abstract

Multi-horizon optimal control aims to select optimal control sequences simultaneously for several possible future scenarios, ensuring consistency at the first stage. While this enables advanced model predictive control schemes that explicitly handle prediction uncertainty, solving these problems tends to be costly. We introduce FanCyqlone, a linear solver that exploits parallelism across both time steps and scenario branches. The method builds on Cyqlone to compute the contribution of each branch and combines these results through a shared root problem. We integrate FanCyqlone into QPALM to develop FanCyQPALM, a solver for multi-horizon optimal control problems with general linear stage-wise constraints. We compare its performance with state-of-the-art solvers on spring-mass and quadruped control benchmarks.

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.

abstract compiled · 2026-11-14

The authors' main claim, as the classifier picked it out 0.50

“We compare its performance with state-of-the-art solvers on spring-mass and quadruped control benchmarks.”

How the main claim is stated: asserted 0.79

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.12 · human participants 0.02 · controlled comparison 0.63 · randomized assignment 0.01 · states quantitative result 0.04 · compares with prior results 0.96 · mentions code or data availability 0.03

The abstract, sentence by sentence

This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.

SentenceRoleThe authors' own workStates the main conclusionStrength
Multi-horizon optimal control aims to select optimal control sequences simultaneously for several possible future scenarios, ensuring consistency at the first stage. background 1.00 0.05 0.04 asserted 1.00
While this enables advanced model predictive control schemes that explicitly handle prediction uncertainty, solving these problems tends to be costly. background 0.81 0.08 0.03 asserted 0.90
We introduce FanCyqlone, a linear solver that exploits parallelism across both time steps and scenario branches. contribution 0.92 0.90 0.17 asserted 1.00
The method builds on Cyqlone to compute the contribution of each branch and combines these results through a shared root problem. method 0.99 0.79 0.07 asserted 1.00
We integrate FanCyqlone into QPALM to develop FanCyQPALM, a solver for multi-horizon optimal control problems with general linear stage-wise constraints. contribution 0.67 0.95 0.12 asserted 1.00
We compare its performance with state-of-the-art solvers on spring-mass and quadruped control benchmarks. method 0.73 0.93 0.08 asserted 0.79

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from simulation or computation 0.97

What was examined, and what was not

Sources read

  • arXiv listing abstract v1

Not examined

  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers

Levels run

  • P abstract

Not run

  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

How the labels were made

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-14: 1 request, 4,839 input tokens.

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON

Figures (6)
Figure 1 of the paper
Figure 1. Block struc￾ture of the per￾muted KKT ma￾trix Kj . The banded matrices along the light gray block-diagonal can be fac￾torized independently, using a mod￾ified Riccati recursion. Each of the np processors factorizes nv blocks at once using batchwise single in￾struction, multiple data (SIMD) vectorization [12, §7.3]. Eliminating the light gray blocks introduces fill￾in in the bottom-right block, shown in black. The resulting Schur com￾plement is block-tridiagonal and can thus be factorized in parallel using cyclic reduction. We refer to the full factorization procedure as CyqloneFact,
Figure 2 of the paper
Figure 2. shows the average time per inner iteration of the sequential and parallel variants of FanCyQPALM for a spring-mass system with M = 12 masses and varying horizon length N, number of branches J, total processor count np, number of processors per branch np, and vector lengths nv. The parallel variant consistently outperforms the sequential variant (for J > 1), indicating that it is beneficial to parallelize over both branches and time. For fixed N, np, and nv, the performance gap increases as J increases. For a fixed J and varying N, the absolute performance gap between the sequential a
Figure 3 of the paper
Figure 3. Spring-Mass benchmark: Total solver time with
Figure 5 of the paper
Figure 5. Quadruped benchmark: Total solver time for
Figure 6 of the paper
Figure 6. Quadruped benchmark: Total solver time for

Showing 5 of the paper's 6 figures. Figures are the authors', reproduced from the paper.

References (31)
  1. [8] F. Song, L. Zhang, L. Wu, J. Drgoňa, and C. N. Jones, “Accelerating branch MPC with two-level parallel direct solves on GPUs,”arXiv preprint arXiv:2609.29977, 2026 on PithPith's reviewarXiv
  2. [1] J. Rawlings, D. Mayne, and M. Diehl,Model Predictive Control: Theory, Computation, and Design. Madison, WI, USA: Nob Hill Publishing, 2nd ed., 2017 on Pith
  3. [2] S. Lucia, T. Finkler, and S. Engell, “Multi-stage nonlinear modelpredictivecontrolappliedtoasemi-batchpolymerization reactor under uncertainty,”Journal of Process Control, vol. 23, no. 9, pp. 1306–1319, 2013 on Pith
  4. [3] E. Klintberg and S. Gros, “A parallelizable interior point method for two-stage robust MPC,”IEEE Transactions on Control Systems Technology, vol. 25, no. 6, pp. 2087–2097, 2017 on Pith
  5. [4] S. H. Nair, H. Lee, E. Joa, Y. Wang, H. E. Tseng, and F. Borrelli, “Predictive control for autonomous driving with uncertain, multimodal predictions,”IEEE Transactions on Control Systems Technology, vol. 33, no. 4, pp. 1178–1192, 2025 on Pith
  6. [5] K. Ren, C. Chen, H. Sung, H. Ahn, I. M. Mitchell, and M. Kamgarpour, “Recursively feasible chance-constrained model predictive control under Gaussian mixture model uncer- tainty,”IEEE Transactions on Control Systems Technology, vol. 33, no. 4, pp. 1193–1206, 2025 on Pith
  7. [6] K. S. Schweidel, S. M. Koehler, V. R. Desaraju, and M. Barić, “Driver-in-the-loop contingency MPC with invariant sets,” in 2022 European Control Conference (ECC), pp. 808–813, 2022 on Pith
  8. [7] M. Geurts, T. Baltussen, A. Katriniok, and M. Heemels, “A contingency model predictive control framework for safe learning,”IEEE Control Systems Letters, vol. 9, pp. 1075–1080, 2025 on Pith
  9. [9] E. Klintberg, J. Dahl, J. Fredriksson, and S. Gros, “An improved dual Newton strategy for scenario-tree MPC,” in 2016 IEEE 55th Conference on Decision and Control (CDC), pp. 3675–3681, 2016 on Pith
  10. [10] J. P. Alsterda, M. Brown, and J. C. Gerdes, “Contingency model predictive control for automated vehicles,” in2019 American Control Conference (ACC), pp. 717–722, 2019 on Pith
  11. [11] J. P. Alsterda and J. C. Gerdes, “Contingency model predic- tive control for linear time-varying systems,”arXiv preprint arXiv:2102.12045, 2021 on PithPith's reviewarXiv
  12. [12] P. Pas and P. Patrinos, “Cyqlone: A parallel, high- performance linear solver for optimal control,”arXiv preprint arXiv:2512.09058v2, 2025 on PitharXiv
  13. [13] B.Hermans,A.Themelis,andP.Patrinos,“QPALM:aNewton- type proximal augmented Lagrangian method for quadratic programs,” in2019 IEEE 58th Conference on Decision and Control (CDC), pp. 4325–4330, 2019 on Pith
  14. [14] B. Hermans, A. Themelis, and P. Patrinos, “QPALM: a proxi- mal augmented Lagrangian method for nonconvex quadratic programs,”Mathematical Programming Computation, vol. 14, no. 3, pp. 497–541, 2022 on Pith
  15. [15] K. F. Løwenstein, D. Bernardini, and P. Patrinos, “QPALM- OCP: A Newton-type proximal augmented Lagrangian solver tailored for quadratic programs arising in model predictive control,”IEEE Control Systems Letters, vol. 8, pp. 1349–1354, 2024 on Pith
  16. [16] G. Frison, D. Kouzoupis, M. Diehl, and J. B. Jørgensen, “A high-performance Riccati based solver for tree-structured quadratic programs,” in20th IF AC World Congress, vol. 50, pp. 14399–14405, 2017 on Pith
  17. [17] G.FrisonandM.Diehl,“HPIPM:ahigh-performancequadratic programming framework for model predictive control,” in21st IF AC World Congress, vol. 53, pp. 6563–6569, 2020 on Pith
  18. [18] C. Leidereiter, A. Potschka, and H. G. Bock, “Dual decom- position for QPs in scenario tree NMPC,” in2015 European Control Conference (ECC), pp. 1608–1613, 2015 on Pith
  19. [19] D. Kouzoupis, E. Klintberg, M. Diehl, and S. Gros, “A dual Newton strategy for scenario decomposition in robust multi- stage MPC,”International Journal of Robust and Nonlinear Control, vol. 28, no. 6, pp. 2340–2355, 2018 on Pith
  20. [20] D. Kouzoupis, E. Klintberg, G. Frison, S. Gros, and M. Diehl, “A dual Newton strategy for tree-sparse quadratic programs and its implementation in the open-source software treeQP,” International Journal of Robust and Nonlinear Control, vol. 29, no. 8, pp. 2438–2457, 2019 on Pith
show 11 more
  1. [21] R. Schwan, D. Kuhn, and C. N. Jones, “Exploiting multistage optimization structure in proximal solvers,” in2025 IEEE 64th Conference on Decision and Control (CDC), pp. 4677–4683, 2025 on Pith
  2. [22] F. Song, R. Schwan, Y. Chen, and C. N. Jones, “Parallel KKT solver in PIQP for multistage optimization,”arXiv preprint arXiv:2511.00946, 2025 on PitharXiv
  3. [23] A. K. Sampathirao, P. Patrinos, A. Bemporad, and P. Sopasakis, “Massively parallelizable proximal algorithms for large-scale stochastic optimal control problems,”Optimal Control Applications and Methods, vol. 45, no. 1, pp. 45–63, 2024 on Pith
  4. [24] R. Moran and P. Sopasakis, “GPU-accelerated SPOCK for scenario-based risk-averse optimal control problems,”arXiv preprint arXiv:2505.12078, 2025 on PithPith's reviewarXiv
  5. [25] A. Bodard, R. Moran, M. Schuurmans, P. Patrinos, and P. Sopasakis, “SPOCK: A proximal method for multistage risk-averse optimal control problems,” in22nd IF AC World Congress, vol. 56, pp. 1944–1951, 2023 on Pith
  6. [26] L. Zhang, C. Lin, and S. Grammatico, “Parallel branch model predictive control on GPUs,”arXiv preprint arXiv:2506.13624, 2025 on PithPith's reviewarXiv
  7. [27] J. Sousa-Pinto, “Rake-compress Riccati recursions for par- allel scenario-tree model predictive control,”arXiv preprint arXiv:2608.01332, 2026 on PithPith's reviewarXiv
  8. [28] Y. Wang and S. Boyd, “Fast model predictive control using online optimization,”IEEE Transactions on Control Systems Technology, vol. 18, no. 2, pp. 267–278, 2010 on Pith
  9. [29] P.-A. Léziart,Locomotion control of a lightweight quadruped robot. PhD thesis, Université Paul Sabatier - Toulouse III, 2022 on Pith
  10. [30] H. Ferreau, C. Kirches, A. Potschka, H. Bock, and M. Diehl, “qpOASES:Aparametricactive-setalgorithmforquadraticpro- gramming,”Mathematical Programming Computation, vol. 6, no. 4, pp. 327–363, 2014 on Pith
  11. [31] D. E. Crabtree and E. V. Haynsworth, “An identity for the Schur complement of a matrix,”Proceedings of the American Mathematical Society, vol. 22, no. 2, pp. 364–366, 1969. Appendix Proof of Proposition II.1. We omit the branch indexj for notational simplicity. The Riccati rec... on Pith

Challenges and discussion

Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.

No comments yet.

Sign in to comment