arXiv (All)
open access
Square Root Gauss-Newton iLQR
The iterative Linear Quadratic Regulator (iLQR) is a widely used algorithm for nonlinear trajectory optimization. At each iteration, it solves a local linear-quadratic approximation of the problem via dynamic programming, propagating a quadratic cost-to-go function. If the Hessian of the cost-to-go
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Convergence Analysis of Newton Methods for Nonlinear Optimal Control Problems#1078188
- Lyapunov Functions and $R$-Linear Convergence for Quadratic Barzilai-Borwein Dynamics#1000056
- Elastic ODYN: Differentiable Optimization for Infeasible Control and Learning in Robotics#1141569
- Rank-Dependent Error Bounds and Near-Optimality in Quantum Control via Hierarchical Tucker Surrogates#1084619
- SALSA-RL: Stability Analysis in the Latent Space of Actions for Reinforcement Learning#128348
Record · ID 1035023
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive