New algorithms for discrete-time optimal control problems

The paper presents new demonstrably convergent first-order iterative algorithms for unconstrained discrete-time optimal control problems. The algorithms, which solve the linear-quadratic problem in one iterative step, are particularly suited for solving nonlinear problems with linear constraints via penalty function methods. The proofs of the reduction of cost at each iteration and convergence of the algorithms are provided.