By Topic

Solving Interpolation Problems via Generalized Eigenvalue Minimization

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

4 Author(s)
V. Balakrishnan ; Department of Electrical Engineering, Stanford University, Stanford CA 94305 USA ; E. Feron ; S. Boyd ; L. El Ghaoui

A number of problems in the analysis and design of control systems may be reformulated as the problem Of minimizing the largest generalized eigenvalue of a pair of symmetric matrices which depend affinely on the decision variables, subject to constraints that are linear matrix inequalities. For these generalized eigenvalue problems, there exist numerical algorithms that are guaranteed to be globally convergent, have polynomial worst-case complexity, and stopping criteria that guarantee desired accuracy. In this paper, we show how a number of important interpolation problems in control may be solved via generalized eigenvalue minimization.

Published in:

American Control Conference, 1993

Date of Conference:

2-4 June 1993