pith. sign in

arxiv: 1506.00300 · v1 · pith:5FRFXYYKnew · submitted 2015-05-31 · 🧮 math.OC · cs.SY· eess.SY

How To Tame Your Sparsity Constraints

classification 🧮 math.OC cs.SYeess.SY
keywords controllerproblemconstraintscontrollersdesigningeasyinftysparse
0
0 comments X
read the original abstract

We show that designing sparse $H_\infty$ controllers, in a discrete (LTI) setting, is easy when the controller is assumed to be an FIR filter. In this case, the problem reduces to a static output feedback problem with equality constraints. We show how to obtain an initial guess, for the controller, and then provide a simple algorithm that alternates between two (convex) feasibility programs until converging, when the problem is feasible, to a suboptimal $H_\infty$ controller that is automatically stable. As FIR filters contain the information of their impulse response in their coefficients, it is easy to see that our results provide a path of least resistance to designing sparse robust controllers for continuous-time plants, via system identification methods.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.