A continuous knapsack problem formulation for the robustness analysis of a polytope of polynomials
V. Cerone, Federico Della Croce · 2005
The problem of checking robust stability of a polytope of polynomials is equivalent to a zero exclusion condition at each frequency. In this paper, we show that this problem can be formulated as two continuous knapsack problems with bounded variables, which are solvable in /spl Oscr/(n) time.