This paper presents primal-dual formulation of a convex optimization problem related to l1 interpolatory-projection algorithm. The use of duality theory permits to obtain information on the structure of optimal solutions for l1 identi£cation problem and gives extra analytical tools for the analysis of identi£cation error and the estimation of a lowerbound for noise amplitude. The proposed analysis applies also to the case of l1 model validation problem and characterizes properties of uncertainty block and disturbance signal. A simulation example illustrates the results.
Read full abstract