Learning zero-sum linear quadratic games with improved sample complexity and last-iterate convergence
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 802915 (Why is no real title available?)
- scientific article; zbMATH DE number 889612 (Why is no real title available?)
- A model-free first-order method for linear quadratic regulator with \(\tilde{O}(1/\varepsilon)\) sampling complexity
- Computational methods for parametric LQ problems--A survey
- Convergence and Sample Complexity of Gradient Methods for the Model-Free Linear–Quadratic Regulator Problem
- Convergence of policy gradient methods for finite-horizon exploratory linear-quadratic control problems
- Decentralized stabilization via game theoretic methods
- Distributed Reinforcement Learning for Decentralized Linear Quadratic Control: A Derivative-Free Policy Optimization Approach
- Optimizing static linear feedback: gradient method
- Policy Gradient Methods for the Noisy Linear Quadratic Regulator over a Finite Horizon
- Policy optimization for \(\mathcal{H}_2\) linear control with \(\mathcal{H}_\infty\) robustness guarantee: implicit regularization and global convergence
- Semidefinite programming duality and linear time-invariant systems
- Sensitivity of the stable discrete-time Lyapunov equation
- State-space formulae for all stabilizing controllers that satisfy an \(H_{\infty}\)-norm bound and relations to risk sensitivity
- The Sensitivity of the Stable Lyapunov Equation
- \(H^ \infty\)-optimal control and related minimax design problems. A dynamic game approach.
This page was built for publication: Learning zero-sum linear quadratic games with improved sample complexity and last-iterate convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6925767)
