By Topic

Robust control via concave minimization local and global algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
P. Apkarian ; ONERA-CERT, Toulouse, France ; Haong Duong Tuan

This paper deals with the robust control problem of linear fractional representation uncertain systems depending on a time-varying parameter uncertainty. Our main result exploits a linear matrix inequality (LMI) characterization involving scalings and Lyapunov variables subject to an additional essentially non-convex algebraic constraint. The non-convexity enters the problem in the form of a rank deficiency condition or matrix inverse relation on the scalings only. It is shown that such problems and many others can be formulated as the concave minimization of a nonlinear functional subject to LMI constraints. The local Frank and Wolfe feasible direction algorithm is introduced. Several efficient global concave minimization programming methods are also introduced and combined with the local feasible direction method to secure and certify global optimality of the solutions. The implementation details of the algorithms are covered

Published in:

Decision and Control, 1998. Proceedings of the 37th IEEE Conference on  (Volume:4 )

Date of Conference:

16-18 Dec 1998