João Sousa-Pinto, Dominique Orban
Published 2024-07-07Version 1
We present a new algorithm for solving linear-quadratic regulator (LQR) problems with linear equality constraints. This is the first such exact algorithm that is guaranteed to have a runtime that is linear in the number of stages, as well as linear in the number of both state-only constraints as well as mixed state-and-control constraints, without imposing any restrictions on the problem instances. We also show how to easily parallelize this algorithm to run in parallel runtime logarithmic in the number of stages of the problem.
On the convergence of an efficient algorithm for Kullback-Leibler approximation of spectral densities
An efficient algorithm for the $\ell_{p}$ norm based metric nearness problem
An Efficient Augmented Lagrangian Based Method for Constrained Lasso
![QR code for arXiv:2407.05433 [math.OC]](http://oss.arxitics.com/images/favicon.svg)