Solving interpolation problems via generalized eigenvalue minimization

V. Balakrishnan, E. Feron, S. Boyd, L. El Ghaoui

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

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.
Original languageEnglish (US)
Title of host publicationAmerican Control Conference
PublisherPubl by IEEEPiscataway
Pages2647-2648
Number of pages2
ISBN (Print)0780308611
DOIs
StatePublished - Jan 1 1993
Externally publishedYes

Fingerprint Dive into the research topics of 'Solving interpolation problems via generalized eigenvalue minimization'. Together they form a unique fingerprint.

Cite this