Maximally-diagonal solution to the inverse LQR problem

The inverse LQR problem is solved, using a convex optimization technique. The non-diagonal elements of the state weighting matrix are minimized, as opposed to the approaches existing in the literature. This minimization is very important from practical point of view.<
>