zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Synthesis of globally optimal controllers for robust performance to unstructured uncertainty. (English) Zbl 0853.93044
The author presents an algorithm for controller design achieving global optimal performance in the sense of $l_1$-norm minimization [{\it M. A. Dahleh}, {\it J. B. Pearson} and {\it J. Boyd, jun}, IEEE Trans. Autom. Control AC-32, 314-322 (1987; Zbl 0622.93041)] for discrete-time linear time-invariant systems with structured time-varying or nonlinear uncertainties with induced $l_\infty$ norm bounds. The algorithm is based on the equivalence of the $l_1$ optimization problem and an infinite-dimensional linear programming problem which could be solved by approximation in the form of the FMV (finitely many variable) or the FME (finitely many equations) method. The main difference between the linear programs arising from the standard $l_1$ problem and those proposed in the paper is the dependence of the problem on the scaling parameter which itself is an optimization parameter. The approach proposed by the author is to use postoptimal sensitivity analysis to reduce the problem to a finite set of solvable problems followed by the minimization over all values of the scaling parameters. The algorithm seems to be simple and leads to the global optimum of the approximated problem. Unfortunately, the example presented in the paper is rubbish. A nominal plant considered by the author is the first order lag compensator. The use of the sophisticated algorithm to ensure robust performance even in the presence of severe uncertainties for such a plant seems to be out of sense.

93B50Synthesis problems
93B35Sensitivity (robustness) of control systems
93D09Robust stability of control systems
90C31Sensitivity, stability, parametric optimization
Full Text: DOI