On the Convergence of the Iterative Linear Exponential Quadratic Gaussian Algorithm to Stationary Points
Not on the map. Why?
Abstract (arXiv)
A classical method for risk-sensitive nonlinear control is the iterative linear exponential quadratic Gaussian algorithm. We present its convergence analysis from a first-order optimization viewpoint. We identify the objective that the algorithm actually minimizes and we show how the addition of a proximal term guarantees convergence to a stationary point.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 18 Oct 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 0; 2024: 1; 2025: 1.
4 papers.
- 2021Derivative-Free Policy Optimization for Linear Risk-Sensitive and Robust Control Design: Implicit Regularization and Sample Complexitycited by 15
- 2022RAP: Risk-Aware Prediction for Robust Planningcited by 12
- 2024Interacting Particle Systems for Fast Linear Quadratic RLcited by 1
- 2025Power Homotopy for Zeroth-Order Non-Convex Optimizationscited by 1
- 2025Power Homotopy for Zeroth-Order Non-Convex Optimizations17 Nov 2025
- 2024Interacting Particle Systems for Fast Linear Quadratic RL16 Jun 2024
- 2022RAP: Risk-Aware Prediction for Robust Planning4 Oct 2022
- 2021Derivative-Free Policy Optimization for Linear Risk-Sensitive and Robust Control Design: Implicit Regularization and Sample Complexity4 Jan 2021