pith. sign in

arxiv: 2512.07749 · v2 · submitted 2025-12-08 · 📡 eess.SY · cs.SY

The explicit game-theoretic linear quadratic regulator for constrained multi-agent systems

Emilio Benenati , Giuseppe Belgioioso This is my paper

Pith reviewed 2026-05-17 00:13 UTC · model grok-4.3

classification 📡 eess.SY cs.SY
keywords explicit model predictive controllinear quadratic gamesNash equilibriaconstrained dynamic gamesmulti-agent systemsvariational inequalitiesgame-theoretic control
0
0 comments X

The pith

An efficient algorithm computes explicit open-loop solutions for constrained linear-quadratic dynamic games among multiple agents.

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

The paper develops a method to precompute the full open-loop Nash equilibria for finite- and infinite-horizon linear-quadratic games that include state and input constraints. It does so by recasting the equilibrium conditions as a multiparametric affine variational inequality, which extends the single-agent explicit LQR and MPC techniques to non-cooperative multi-agent problems. Because the heavy computation occurs offline, the resulting explicit control law can be evaluated quickly online. This makes game-theoretic model predictive control practical for teams of moderate size even when sampling rates are high. Numerical tests confirm that the approach yields faster and more accurate solutions than existing iterative game solvers.

Core claim

The open-loop Nash equilibria of constrained linear-quadratic dynamic games can be fully characterized by a multiparametric affine variational inequality, allowing an efficient algorithm to compute the explicit solution for both finite- and infinite-horizon cases without extra assumptions on uniqueness or existence in the multi-agent setting.

What carries the argument

multiparametric affine variational inequality that encodes the open-loop Nash equilibria of the constrained game

If this is right

  • Game-theoretic MPC becomes viable at very high sampling rates for multi-agent systems of moderate size.
  • Order-of-magnitude reductions in online computation time are achieved compared with state-of-the-art iterative solvers.
  • The same explicit framework applies to both finite- and infinite-horizon problems.
  • Solution accuracy improves because the offline characterization avoids numerical convergence issues of online solvers.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same multiparametric technique could be tested on Stackelberg or potential games with constraints to see whether explicit solutions remain tractable.
  • Applications such as coordinated vehicle platoons or distributed energy resources might now run game-based controllers at rates previously considered too fast for non-cooperative methods.
  • If the variational inequality admits a closed-form solution in special cases, further analytic expressions for the equilibrium feedback laws could be derived.

Load-bearing premise

The open-loop Nash equilibria of the constrained linear-quadratic game can be fully characterized via a multiparametric affine variational inequality without additional assumptions on uniqueness or existence for the multi-agent case.

What would settle it

Construct a concrete constrained linear-quadratic game with two or more agents whose open-loop Nash equilibria cannot be recovered as solutions of the multiparametric affine variational inequality, or show that the explicit solution cannot be computed for a moderate-sized system in reasonable offline time.

Figures

Figures reproduced from arXiv: 2512.07749 by Emilio Benenati, Giuseppe Belgioioso.

Figure 1
Figure 1. Figure 1: In game-theoretic MPC, control actions are generated [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Left: combinatorial tree of constraint in [37, Ex. [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Online evaluation time of the explicit solution mapping (23) constructed with Alg. 1, compared against the computation [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Solution quality, measured by the natural residual [8, § 6], of the explicit mapping computed with Alg. 1, compared [PITH_FULL_IMAGE:figures/full_fig_p006_4.png] view at source ↗
Figure 6
Figure 6. Figure 6: Finite-state machine that switches between the overtake [PITH_FULL_IMAGE:figures/full_fig_p007_6.png] view at source ↗
read the original abstract

We present an efficient algorithm to compute the explicit open-loop solution to both finite and infinite-horizon dynamic games subject to state and input constraints. Our approach relies on a multiparametric affine variational inequality characterization of the open-loop Nash equilibria and extends the classical explicit constrained LQR and MPC frameworks to multi-agent non-cooperative settings. A key practical implication is that linear-quadratic game-theoretic MPC becomes viable even at very high sampling rates for multi-agent systems of moderate size. Extensive numerical experiments demonstrate order-of-magnitude improvements in online computation time and solution accuracy compared with state-of-the-art game-theoretic solvers.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript presents an efficient algorithm to compute explicit open-loop solutions for both finite- and infinite-horizon constrained linear-quadratic dynamic games in multi-agent non-cooperative settings. It relies on a multiparametric affine variational inequality (AVI) characterization of open-loop Nash equilibria, extending single-agent explicit constrained LQR/MPC methods, and reports order-of-magnitude improvements in online computation time and solution accuracy via numerical experiments.

Significance. If the AVI characterization is shown to exactly match the set of open-loop Nash equilibria and the algorithm is computationally efficient without hidden assumptions, the work would meaningfully extend explicit MPC techniques to game-theoretic multi-agent control, enabling high-rate implementations in applications such as robotics and autonomous systems. The inclusion of infinite-horizon cases and the focus on constraint handling are positive aspects.

major comments (2)
  1. [§3.2] §3.2 (AVI characterization): The assertion that concatenating the KKT conditions across agents yields an affine VI whose solution set coincides exactly with the open-loop Nash equilibria, without additional assumptions on monotonicity or existence, is load-bearing for the central claim. In coupled multi-agent dynamics the resulting game operator is affine but not necessarily monotone, so the derivation should explicitly verify that no implicit structural condition (e.g., positive-semidefiniteness of the overall mapping) is required.
  2. [§4] §4 (algorithm and complexity): The claimed efficiency of the multiparametric solver extension is not accompanied by a precise complexity bound in terms of number of agents, state dimension, and horizon length; without this, it is unclear whether the region enumeration remains tractable for moderate-size systems as asserted in the abstract.
minor comments (2)
  1. [§2] The notation for concatenated vectors (e.g., x, u across agents) should be introduced with an explicit definition early in §2 to prevent ambiguity when transitioning from single- to multi-agent formulations.
  2. [§5] Numerical results in §5 would be strengthened by reporting the number of critical regions generated and the offline computation time, rather than only online speedup figures.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive and detailed comments on our manuscript. We address each major comment below, providing clarifications and indicating the revisions we will incorporate to strengthen the paper.

read point-by-point responses

  1. Referee: [§3.2] §3.2 (AVI characterization): The assertion that concatenating the KKT conditions across agents yields an affine VI whose solution set coincides exactly with the open-loop Nash equilibria, without additional assumptions on monotonicity or existence, is load-bearing for the central claim. In coupled multi-agent dynamics the resulting game operator is affine but not necessarily monotone, so the derivation should explicitly verify that no implicit structural condition (e.g., positive-semidefiniteness of the overall mapping) is required.

    Authors: We appreciate the referee drawing attention to this foundational aspect. The equivalence holds by construction: an open-loop strategy profile constitutes a Nash equilibrium if and only if each agent's strategy satisfies its own KKT optimality conditions given the fixed strategies of the other agents. Concatenating these per-agent KKT systems therefore produces an affine variational inequality whose solution set is exactly the set of open-loop Nash equilibria, without invoking monotonicity, existence, or positive-semidefiniteness of the aggregate mapping. Monotonicity would be relevant for uniqueness or algorithmic convergence but is not needed for the set-equivalence claim. We will add an explicit clarifying paragraph in §3.2 stating this reasoning and confirming that no hidden structural assumptions are imposed. revision: yes

  2. Referee: [§4] §4 (algorithm and complexity): The claimed efficiency of the multiparametric solver extension is not accompanied by a precise complexity bound in terms of number of agents, state dimension, and horizon length; without this, it is unclear whether the region enumeration remains tractable for moderate-size systems as asserted in the abstract.

    Authors: We agree that an explicit discussion of complexity scaling would improve transparency. The multiparametric AVI algorithm inherits the combinatorial nature of explicit MPC region enumeration; the number of critical regions grows exponentially with the total number of constraints (hence with the number of agents, state dimension, and horizon length) in the worst case. We do not claim a polynomial bound. In the revised §4 we will include a brief complexity discussion referencing this exponential scaling, while noting that the target regime is moderate-sized systems (few agents, modest dimensions and horizons) for which the offline enumeration remains practical, as demonstrated by the numerical results in §5. We will also qualify the abstract claim accordingly. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation extends prior frameworks independently

full rationale

The paper claims an efficient algorithm for explicit open-loop solutions to constrained dynamic games via multiparametric affine variational inequality characterization of open-loop Nash equilibria, extending single-agent explicit LQR/MPC to multi-agent settings. No quoted equations or steps in the abstract or context reduce a prediction or central result to a fitted input, self-definition, or load-bearing self-citation chain by construction. The characterization is presented as holding without additional uniqueness assumptions, and the approach relies on established variational inequality and explicit MPC literature as external support rather than circular reuse. This is a standard non-circular extension with independent algorithmic content.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the assumption that constrained LQ dynamic games admit a multiparametric affine variational inequality representation of their open-loop Nash equilibria.

axioms (1)
  • domain assumption Open-loop Nash equilibria of the constrained linear-quadratic dynamic game can be characterized by a multiparametric affine variational inequality.
    This is the key modeling step that enables the explicit solution approach.

pith-pipeline@v0.9.0 · 5391 in / 1059 out tokens · 82440 ms · 2026-05-17T00:13:05.094819+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Forward citations

Cited by 2 Pith papers

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

  1. \texttt{DR-DAQP}: An Hybrid Operator Splitting and Active-Set Solver for Affine Variational Inequalities

    eess.SY 2026-04 unverdicted novelty 7.0

    DR-DAQP is a hybrid solver using operator splitting and active-set methods that solves affine variational inequalities exactly in finite time under specified conditions and runs up to two orders of magnitude faster th...

  2. Stability and Sensitivity Analysis for Objective Misspecifications Among Model Predictive Game Controllers

    eess.SY 2026-04 unverdicted novelty 5.0

    The paper provides stability criteria for multi-agent systems with heterogeneous model predictive game controllers and quantifies sensitivity of equilibria to objective misspecifications.

Reference graph

Works this paper leans on

38 extracted references · 38 canonical work pages · cited by 2 Pith papers

  1. [1]

    Bas ¸ar and G

    T. Bas ¸ar and G. J. Olsder,Dynamic Noncooperative Game Theory. No. 23 in Classics in Applied Mathematics, Philadelphia: SIAM, 2nd ed ed., 1999

    work page 1999

  2. [2]

    Feedback Nash Equilibria for Scalar Two-Player Linear-Quadratic Discrete-Time Dynamic Games,

    B. Nortmann, A. Monti, M. Sassano, and T. Mylvaganam, “Feedback Nash Equilibria for Scalar Two-Player Linear-Quadratic Discrete-Time Dynamic Games,”IFAC-PapersOnLine, vol. 56, no. 2, pp. 1772–1777, 2023

    work page 2023

  3. [3]

    Nash equilibria in scalar discrete-time linear quadratic games,

    G. Salizzoni, R. Ouhamma, and M. Kamgarpour, “Nash equilibria in scalar discrete-time linear quadratic games,” in2025 European Control Conference (ECC), pp. 2416–2421, IEEE, June 2025

    work page 2025

  4. [4]

    Bridging Finite and Infinite- Horizon Nash Equilibria in Linear Quadratic Games,

    G. Salizzoni, S. Hall, and M. Kamgarpour, “Bridging Finite and Infinite- Horizon Nash Equilibria in Linear Quadratic Games,”arXiv preprint arXiv.2508.20675, 2025

    work page arXiv 2025

  5. [5]

    Algorithms for computing Nash equilibria in deterministic LQ games,

    J. Engwerda, “Algorithms for computing Nash equilibria in deterministic LQ games,”Computational Management Science, vol. 4, pp. 113–140, Apr. 2007

    work page 2007

  6. [6]

    OL-NE for LQ differential games: A Port-Controlled Hamiltonian system perspective and some computational strategies,

    M. Sassano, T. Mylvaganam, and A. Astolfi, “OL-NE for LQ differential games: A Port-Controlled Hamiltonian system perspective and some computational strategies,”Automatica, vol. 171, p. 111953, Jan. 2025

    work page 2025

  7. [7]

    Nash Equi- libria for Linear Quadratic Discrete-time Dynamic Games via Iterative and Data-driven Algorithms,

    B. Nortmann, A. Monti, M. Sassano, and T. Mylvaganam, “Nash Equi- libria for Linear Quadratic Discrete-time Dynamic Games via Iterative and Data-driven Algorithms,”IEEE Transactions on Automatic Control, pp. 1–15, 2024

    work page 2024

  8. [8]

    Facchinei and J.-S

    F. Facchinei and J.-S. Pang,Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer Series in Operations Research, New York: Springer, 2007

    work page 2007

  9. [9]

    Local First-Order Algorithms for Constrained Nonlinear Dynamic Games,

    B. Di and A. Lamperski, “Local First-Order Algorithms for Constrained Nonlinear Dynamic Games,” in2020 American Control Conference (ACC), (Denver, CO, USA), pp. 5358–5363, IEEE, July 2020

    work page 2020

  10. [10]

    Sta- bility Certificates for Receding Horizon Games,

    S. Hall, D. Liao-McPherson, G. Belgioioso, and F. D ¨orfler, “Sta- bility Certificates for Receding Horizon Games,”arXiv preprint arXiv:2404.12165, Apr. 2024

    work page arXiv 2024

  11. [11]

    A Real-Time Game Theoretic Planner for Autonomous Two-Player Drone Racing,

    R. Spica, E. Cristofalo, Z. Wang, E. Montijano, and M. Schwager, “A Real-Time Game Theoretic Planner for Autonomous Two-Player Drone Racing,”IEEE Transactions on Robotics, vol. 36, pp. 1389–1403, Oct. 2020

    work page 2020

  12. [12]

    A Game Theoretic Approach for Safe and Distributed Control of Un- manned Aerial Vehicles,

    A. A. Do Nascimento, A. Papachristodoulou, and K. Margellos, “A Game Theoretic Approach for Safe and Distributed Control of Un- manned Aerial Vehicles,” in2023 62nd IEEE Conference on Decision and Control (CDC), (Singapore, Singapore), pp. 1070–1075, IEEE, Dec. 2023

    work page 2023

  13. [13]

    Receding Horizon Games with Coupling Constraints for Demand-Side Man- agement,

    S. Hall, G. Belgioioso, D. Liao-McPherson, and F. Dorfler, “Receding Horizon Games with Coupling Constraints for Demand-Side Man- agement,” inConference on Decision and Control (CDC), (Cancun, Mexico), pp. 3795–3800, IEEE, Dec. 2022

    work page 2022

  14. [14]

    Receding-Horizon Games with Tullock-Based Profit Functions for Electric Ride-Hailing Markets,

    M. Maljkovic, G. Nilsson, and N. Geroliminis, “Receding-Horizon Games with Tullock-Based Profit Functions for Electric Ride-Hailing Markets,” in2024 IEEE 63rd Conference on Decision and Control (CDC), (Milan, Italy), pp. 8384–8389, IEEE, Dec. 2024

    work page 2024

  15. [15]

    Efficient Iterative Linear-Quadratic Approximations for Non- linear Multi-Player General-Sum Differential Games,

    D. Fridovich-Keil, E. Ratner, L. Peters, A. D. Dragan, and C. J. Tomlin, “Efficient Iterative Linear-Quadratic Approximations for Non- linear Multi-Player General-Sum Differential Games,” in2020 IEEE International Conference on Robotics and Automation (ICRA), (Paris, France), pp. 1475–1481, IEEE, May 2020

    work page 2020

  16. [16]

    LUCIDGames: Online Unscented Inverse Dynamic Games for Adaptive Trajectory Prediction and Planning,

    S. Le Cleac’h, M. Schwager, and Z. Manchester, “LUCIDGames: Online Unscented Inverse Dynamic Games for Adaptive Trajectory Prediction and Planning,”IEEE Robotics and Automation Letters, vol. 6, pp. 5485– 5492, July 2021

    work page 2021

  17. [17]

    Online and offline learning of player objectives from partial observations in dynamic games,

    L. Peters, V . Rubies-Royo, C. J. Tomlin, L. Ferranti, J. Alonso-Mora, C. Stachniss, and D. Fridovich-Keil, “Online and offline learning of player objectives from partial observations in dynamic games,”The International Journal of Robotics Research, vol. 42, pp. 917–937, Sept. 2023

    work page 2023

  18. [18]

    Game- Theoretic Planning for Self-Driving Cars in Multivehicle Competitive Scenarios,

    M. Wang, Z. Wang, J. Talbot, J. C. Gerdes, and M. Schwager, “Game- Theoretic Planning for Self-Driving Cars in Multivehicle Competitive Scenarios,”IEEE Transactions on Robotics, vol. 37, pp. 1313–1325, Aug. 2021

    work page 2021

  19. [19]

    α-RACER: Real-Time Algo- rithm for Game-Theoretic Motion Planning and Control in Autonomous Racing using Near-Potential Function,

    D. Kalaria, C. Maheshwari, and S. Sastry, “α-RACER: Real-Time Algo- rithm for Game-Theoretic Motion Planning and Control in Autonomous Racing using Near-Potential Function,” inLearning for Dynamics & Control Conference, PMLR, 2025

    work page 2025

  20. [20]

    Game Theory in Formula 1: Multi-agent Physical and Strategical Interactions,

    G. Fieni, M.-P. Neumann, F. Furia, A. Caucino, A. Cerofolini, V . Ravaglioli, and C. H. Onder, “Game Theory in Formula 1: Multi-agent Physical and Strategical Interactions,”arXiv preprint arXiv.2503.0542, Mar. 2025

    work page arXiv 2025

  21. [21]

    Probabilistic Game-Theoretic Traffic Routing,

    E. Benenati and S. Grammatico, “Probabilistic Game-Theoretic Traffic Routing,”IEEE Transactions on Intelligent Transportation Systems, vol. 25, pp. 13080–13090, Oct. 2024

    work page 2024

  22. [22]

    Stabilizing Model Predictive Control for Generalized Nash Equilibrium Problems using Approximation by α-quasi-GNEPs and Lyapunov End Cost,

    F. M. Hante and A. Topalovi ´c, “Stabilizing Model Predictive Control for Generalized Nash Equilibrium Problems using Approximation by α-quasi-GNEPs and Lyapunov End Cost,” in2025 European Control Conference (ECC), pp. 2427–2432, IEEE, June 2025

    work page 2025

  23. [23]

    Linear-Quadratic Dynamic Games as Receding-Horizon Variational Inequalities,

    E. Benenati and S. Grammatico, “Linear-Quadratic Dynamic Games as Receding-Horizon Variational Inequalities,”IEEE Transactions on Automatic Control, pp. 1–16, 2026 (accepted)

    work page 2026

  24. [24]

    ALGAMES: A fast augmented Lagrangian solver for constrained dynamic games,

    S. Le Cleac’h, M. Schwager, and Z. Manchester, “ALGAMES: A fast augmented Lagrangian solver for constrained dynamic games,” Autonomous Robots, vol. 46, pp. 201–215, Jan. 2022

    work page 2022

  25. [25]

    A Sequential Quadratic Programming Approach to the Solution of Open-Loop Generalized Nash Equilibria,

    E. L. Zhu and F. Borrelli, “A Sequential Quadratic Programming Approach to the Solution of Open-Loop Generalized Nash Equilibria,” in2023 IEEE International Conference on Robotics and Automation (ICRA), (London, United Kingdom), pp. 3211–3217, IEEE, May 2023

    work page 2023

  26. [26]

    ADMM-iCLQG: A Fast Solver of Constrained Dynamic Games for Planning Multi-Vehicle Feedback Trajectory,

    H. Min, P. Yi, W. Wang, J. Lei, and J. Wang, “ADMM-iCLQG: A Fast Solver of Constrained Dynamic Games for Planning Multi-Vehicle Feedback Trajectory,” in2025 IEEE Intelligent Vehicles Symposium (IV), (Cluj-Napoca, Romania), pp. 2265–2272, IEEE, June 2025

    work page 2025

  27. [27]

    A Log-domain Interior Point Method for Convex Quadratic Games,

    B. Liu and D. Liao-McPherson, “A Log-domain Interior Point Method for Convex Quadratic Games,” in2025 American Control Conference (ACC), (Denver, CO, USA), pp. 4891–4896, IEEE, July 2025

    work page 2025

  28. [28]

    The Compu- tation of Approximate Generalized Feedback Nash Equilibria,

    F. Laine, D. Fridovich-Keil, C.-Y . Chiu, and C. Tomlin, “The Compu- tation of Approximate Generalized Feedback Nash Equilibria,”SIAM Journal on Optimization, vol. 33, pp. 294–318, Mar. 2023

    work page 2023

  29. [29]

    AMZ Driverless: The full autonomous racing system,

    J. Kabzan, M. I. Valls, V . J. F. Reijgwart, H. F. C. Hendrikx, C. Ehmke, M. Prajapat, A. B ¨uhler, N. Gosala, M. Gupta, R. Sivanesan, A. Dhall, E. Chisari, N. Karnchanachari, S. Brits, M. Dangel, I. Sa, R. Dub ´e, A. Gawel, M. Pfeiffer, A. Liniger, J. Lygeros, and R. Siegwart, “AMZ Driverless: The full autonomous racing system,”Journal of Field Robotics,...

    work page 2020

  30. [30]

    TUM autonomous motorsport: An autonomous racing software for the Indy Autonomous Challenge,

    J. Betz, T. Betz, F. Fent, M. Geisslinger, A. Heilmeier, L. Hermansdorfer, T. Herrmann, S. Huch, P. Karle, M. Lienkamp, B. Lohmann, F. Nobis, L. ¨Ogretmen, M. Rowold, F. Sauerbeck, T. Stahl, R. Trauth, F. Werner, and A. Wischnewski, “TUM autonomous motorsport: An autonomous racing software for the Indy Autonomous Challenge,”Journal of Field Robotics, vol....

    work page 2023

  31. [31]

    Input-to-State Stability of Newton Meth- ods in Nash Equilibrium Problems with Applications to Game-Theoretic Model Predictive Control,

    M. Liu and I. Kolmanovsky, “Input-to-State Stability of Newton Meth- ods in Nash Equilibrium Problems with Applications to Game-Theoretic Model Predictive Control,”arXiv preprint arXiv.2412.06186, Dec. 2024

    work page arXiv 2024

  32. [32]

    The explicit linear quadratic regulator for constrained systems,

    A. Bemporad, M. Morari, V . Dua, and E. N. Pistikopoulos, “The explicit linear quadratic regulator for constrained systems,”Automatica, vol. 38, pp. 3–20, 2002

    work page 2002

  33. [33]

    A High-Performant Multi-Parametric Quadratic Programming Solver,

    D. Arnstr ¨om and D. Axehill, “A High-Performant Multi-Parametric Quadratic Programming Solver,”arXiv preprint arXiv:2404.05511, Apr. 2024

    work page arXiv 2024

  34. [34]

    Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control,

    J. Eckstein and M. C. Ferris, “Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control,”INFORMS Journal on Computing, vol. 10, pp. 218–235, May 1998

    work page 1998

  35. [35]

    H. H. Bauschke and P. L. Combettes,Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, 2017

    work page 2017

  36. [36]

    D. P. Palomar and Y . C. Eldar,Convex Optimization in Signal Processing and Communications. Cambridge university press, 2010

    work page 2010

  37. [37]

    Combinatorial Approach Toward Multiparametric Quadratic Programming Based on Characterizing Adjacent Critical Regions,

    P. Ahmadi-Moshkenani, T. A. Johansen, and S. Olaru, “Combinatorial Approach Toward Multiparametric Quadratic Programming Based on Characterizing Adjacent Critical Regions,”IEEE Transactions on Auto- matic Control, vol. 63, pp. 3221–3231, Oct. 2018

    work page 2018

  38. [38]

    S. S. Sastry,Nonlinear Systems: Analysis, Stability, and Control. Springer Science & Business Media, 2013

    work page 2013