Optimal H general distance problem with degree constraint

Davut Kavranogtlu*, Maamar Bettayeb

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)289-299
Number of pages11
JournalInternational Journal of Robust and Nonlinear Control
Volume4
Issue number2
DOIs
StatePublished - 1994

Keywords

  • All‐pass imbedding
  • Degree constraint
  • General distance problem
  • Hankel singular values

ASJC Scopus subject areas

  • Control and Systems Engineering
  • General Chemical Engineering
  • Biomedical Engineering
  • Aerospace Engineering
  • Mechanical Engineering
  • Industrial and Manufacturing Engineering
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Optimal H general distance problem with degree constraint'. Together they form a unique fingerprint.

Cite this