On the Convergence of the Iterative Linear Exponential Quadratic Gaussian Algorithm to Stationary Points
Abstract¶
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.
Links¶
Knowledge Base
External
Similar Papers¶
1
84%
2
83%
3
81%
4
81%
Value-Gradient Iteration with Quadratic Approximate Value Functions
Value-Gradient Iteration
5
80%
Derivative-Free Methods for Policy Optimization: Guarantees for Linear Quadratic Systems
Derivative-Free Methods for Policy Optimization