By Topic

Robustness analysis: nonlinear and growing

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)
Glavaski, S. ; Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA, USA ; Tierno, J.E.

A numerical algorithm for analysis of disturbance rejection for nonlinear systems is proposed. The algorithm seeks solutions to Euler-Lagrange equations and is similar to power algorithms for mu-analysis lower bounds, beating conventional optimization on speed and global convergence properties. This is a special case of earlier work and focuses on a problem for which a simple proof of global convergence is available for the case of linear dynamics. Thus we can focus our attention on the convergence problems and lack of convexity created by nonlinearities, and benchmark examples are used to explore these issues

Published in:

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

Date of Conference:

11-13 Dec 1996