* This is a companion report to the arXiv report "Complexity Bounds of
Iterative Linear Quadratic Optimization Algorithms for Discrete Time
Nonlinear Control" by the same authors Access Paper or Ask Questions
* Short version appeared in the proceedings of the 57th Annual Allerton
Conference on Communication, Control, and Computing (Allerton 2019) Access Paper or Ask Questions
* Completely rewritten. New convergence proofs in the clustered and
sparse clustered case. New projection algorithm on sparse clustered vectors Access Paper or Ask Questions
Log in or sign up instantly 🚀
🔥 Discover incredible developments in machine intelligence
🤖 Quickly get code for any ML model
🔑 Get help from authors, engineers & researchers