The Four-Block Model Matching Problem in l^1 and Infinite-Dimensional Linear Programming

DOI10.1137/0331034MaRDI QIDQ4695404zbMATH OpenOpenAlexFDO

Authors Olof Staffans

Publication date 13 September 1993

Published in SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0331034

zbMATH Keywords

general model matching problemlinear programmingtime-invariant

Mathematics Subject Classification ID

Linear programming (90C05) Programming in abstract spaces (90C48) Control/observation systems governed by ordinary differential equations (93C15) Discrete-time control/observation systems (93C55) Model systems in control theory (93C99) Stabilization of systems by feedback (93D15)

Recommendations

• scientific article; zbMATH DE number 3920183
• Model reduction for continuous- and discrete-time systems via squared-magnitude responses matching by linear programming
• scientific article; zbMATH DE number 3965817
• Approximation of Infinite-Dimensional Linear Programming Problems which Arise in Stochastic Control
• A quadratic programming approach for solving the l/sub 1/ multiblock problem

Cited in

(6)

• Mixed sensitivity minimization problems with rational \(\ell^ 1\)-optimal solutions
• MIMO l^ 1-optimization with a scalar control
• \(\ell_1\)-minimization with magnitude constraints in the frequency domain
• Robust stabilization -- BIBO stability, distance notions and robustness optimization
• scientific article; zbMATH DE number 3965817 (Why is no real title available?)
• MIMO l 1 optimal control problems via the polynomial equations approach

This page was built for publication: The Four-Block Model Matching Problem in $l^1 $ and Infinite-Dimensional Linear Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4695404)