Hostname: page-component-77f85d65b8-g98kq Total loading time: 0 Render date: 2026-04-18T17:08:48.698Z Has data issue: false hasContentIssue false

New algorithms for discrete-time optimal control problems

Published online by Cambridge University Press:  17 February 2009

Nikola B. Nedeljković
Affiliation:
School of Mathematical and Physical Sciences, Murdoch University, Murdoch 6150, Western Australia.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1984