Premium
Optimal H ∞ general distance problem with degree constraint
Author(s) -
Kavranogtlu Davut,
Bettayeb Maamar
Publication year - 1994
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/rnc.4590040205
Subject(s) - degree (music) , constraint (computer aided design) , block (permutation group theory) , mathematics , singular solution , singular value , mathematical optimization , mathematical analysis , combinatorics , geometry , eigenvalues and eigenvectors , physics , quantum mechanics , acoustics
In this paper the optimal H ∞ , general distance problem, for continuous‐time systems, with a prescribed degree on the solution is studied. The approach is based on designing the Hankel singular values using an imbedding idea. The problem is first imbedded into another problem with desirable characteristics on the Hankel singular values, then the solution to the original problem is retracted via a compression. The result is applicable to both the one‐block and the four‐block problems. A special case is given for illustration.