atlas

Research map / Optimization / Nonconvex and smooth optimization

Iterative Linearized Control: Stable Algorithms and Complexity Guarantees

ICML 2019 · Optimization › Nonconvex and smooth optimization · approach: Complexity of nonconvex first-order methods · 6 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Adding a proximal regularization term to the Gauss-Newton (ILQR) step, giving regularized ILQR (RegILQR)ILQR / Gauss-Newton control steps · inverted pendulum and two-links arm control problems (horizon 100)function value and gradient norm convergenceHelped
Adding Catalyst-style extrapolation step to regularized Gauss-Newton (accelerated regularized ILQR)Regularized ILQR · inverted pendulum and two-links arm control problems (horizon 100)function value and gradient norm convergenceHelped
Using a regularized Gauss-Newton step instead of plain Gauss-Newton (ILQR) in the composite settingNonlinear control with composite objective · theoretical complexityglobal convergence rate to stationary pointHelped
Using a line-search (Armijo) on ILQR stepsILQR · inverted pendulum and two-links armconvergenceNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy