Abstract
We present a constructive theory for solving the Nevanlinna-Pick problem with degree constraint. The theory relies on convex optimization and the method generates all solutions with degree less than the number of interpolation conditions. The degree of the interpolant relates to the dimension of the feedback control system or of a modeling filter, depending on the context for the particular application.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 982-988 |
| Number of pages | 7 |
| Journal | Proceedings of the IEEE Conference on Decision and Control |
| Volume | 1 |
| State | Published - Dec 1 1999 |
| Event | The 38th IEEE Conference on Decision and Control (CDC) - Phoenix, AZ, USA Duration: Dec 7 1999 → Dec 10 1999 |