Optimization of Bilinear Systems Using a Higher-Order Variational Method

S. K. Agrawal, X. Xu and N. Faiz
Additional contact information
S. K. Agrawal: University of Delaware
X. Xu: University of Delaware
N. Faiz: University of Delaware

Journal of Optimization Theory and Applications, 2000, vol. 105, issue 1, No 4, 55-72

Abstract: Abstract This paper derives some optimization results for bilinear systems using a higher-order method by characterizing them over matrix Lie groups. In the derivation of the results, first a bilinear system is transformed to a left-invariant system on matrix Lie groups. Then, the product of exponential representation is used to express this system in canonical form. Next, the conditions for optimality are obtained by the principles of variational calculus. It is demonstrated that closed-form analytical solutions exist for classes of bilinear systems whose Lie algebra are nilpotent.

Keywords: optimal control; bilinear systems; nilpotent Lie algebra; products of exponentials (search for similar items in EconPapers)
Date: 2000
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1023/A:1004609911204 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:105:y:2000:i:1:d:10.1023_a:1004609911204

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1023/A:1004609911204

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().