By Topic

A solution to MIMO 4-block l1 optimal control problems via convex optimization

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
$31 $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)
Sznaier, M. ; Dept. of Electr. Eng., Pennsylvania State Univ., University Park, PA, USA ; Bu, J.

Proposes an alternative solution to 4-block l1 problems. This alternative is based upon the idea of transforming the l 1 problem into an equivalent (in the sense of having the same solution) mixed l1/H problem that can be solved using convex optimization techniques. The proposed algorithm has the advantage of generating, at each step, an upper bound of the cost that converges uniformly to the optimal cost. Moreover, it allows for easily incorporating frequency and regional pole placement constraints. Finally, it does not require either solving large LP problems or obtaining the zero structure of the plant and computing the so-called zero interpolation and the rank interpolation conditions. The main drawback of this method is that it may suffer from order inflation. However, consistent numerical experience shows that the controllers obtained, albeit of high order, are amenable to model reduction by standard methods, with virtually no loss of performance

Published in:

American Control Conference, Proceedings of the 1995  (Volume:1 )

Date of Conference:

21-23 Jun 1995