Generalized Kleinman-Newton method in discrete-time This research was supported by grants 443166/2014-5, 306911/2015-9 and 303887/2014-1 from the “Brazilian National Research Council-CNPq”

This paper addresses the general problem of optimal linear control design subject to convex gain constraints. The classical approaches based exclusively on Riccati equations or linear matrix inequalities (LMIs) are unable to treat problems that incorporate feedback gain constraints, as for instance,...

Full description

Saved in:
Bibliographic Details
Published inIFAC-PapersOnLine Vol. 50; no. 1; pp. 6697 - 6702
Main Authors Geromel, José C., Deaecto, Grace S.
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 01.07.2017
Subjects
constrained control problems
discrete-time systems
Optimal control
constrained control problems
discrete-time systems
Optimal control
Online AccessGet full text
ISSN2405-8963
2405-8963
DOI10.1016/j.ifacol.2017.08.1164

Cover

More Information
Summary:This paper addresses the general problem of optimal linear control design subject to convex gain constraints. The classical approaches based exclusively on Riccati equations or linear matrix inequalities (LMIs) are unable to treat problems that incorporate feedback gain constraints, as for instance, reduced order (including static) output feedback control design. In this paper, a genuine generalization of the celebrated Kleinman-Newton Method (KM) is proposed and keeps intact the monotone convergence to a local minimum. Discrete-time systems performance is revisited in order to express them in the same framework of the original KM. We believe that other control design problems can be also considered by the adoption of the same ideas and algebraic manipulations. Several examples borrowed from the literature are solved for illustration of the numerical performance.
ISSN:2405-8963
2405-8963
DOI:10.1016/j.ifacol.2017.08.1164