Abstract
This paper presents a method for identifying discrete-time models with a lower bound on the identified modal frequencies. A frequency bound is imposed as a convex constraint for a weighted least squares optimization in subspace identification. We solve the convex optimization problem using existing linear programming techniques'.
| Original language | English |
|---|---|
| Pages (from-to) | 867-872 |
| Number of pages | 6 |
| Journal | Proceedings of the American Control Conference |
| Volume | 1 |
| DOIs | |
| State | Published - 2004 |
| Event | Proceedings of the 2004 American Control Conference (AAC) - Boston, MA, United States Duration: Jun 30 2004 → Jul 2 2004 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering