This paper considers the problem of stability robustness with respect to a class of nonlinear time-varying perturbations which are bounded in a component-wise rather than aggregated manner. A family of robustness bounds is parameterized in terms of a non-singular symmetric matrix. It is shown that the problem of computing the largest robustness bound over the set of non-singular symmetric matrices can be approximated by a smooth minimization problem over a compact set. A convergent algorithm for computing an optimal robustness bound is proposed in the form of a gradient flow.
No takes yet. Share an insight, caveat, or question.
Yan et al. (2001) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: