A Convex Optimization Approach to Synthesizing Bounded Complexity <formula formulatype="inline"><tex Notation="TeX">$\ell^{\infty}$</tex> </formula> Filters

DOI10.1109/TAC.2011.2162893zbMath1369.93203OpenAlexW2120569351WikidataQ59341736 ScholiaQ59341736MaRDI QIDQ5352687

Publication date: 8 September 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2011.2162893

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Design techniques (robust design, computer-aided design, etc.) (93B51) (H^infty)-control (93B36)

Related Items (5)

Exact recursive updating of state uncertainty sets for linear SISO systems ⋮ Finite horizon constrained control and bounded-error estimation in the presence of missing data ⋮ Simultaneous state and unknown input set‐valued observers for quadratically constrained nonlinear dynamical systems ⋮ Path-dependent controller and estimator synthesis with robustness to delayed and missing data ⋮ On the possibility of using the method of sign-perturbed sums for the processing of dynamic test data

This page was built for publication: A Convex Optimization Approach to Synthesizing Bounded Complexity <formula formulatype="inline"><tex Notation="TeX">$\ell^{\infty}$</tex> </formula> Filters