A non-smooth lower bound on ν

Authors


SUMMARY

A non-smooth optimization technique to directly compute a lower bound on the skew structured singular value ν is developed. As corroborated by several real-world challenging applications, the proposed technique can provide tighter lower bounds when compared with currently available techniques. Moreover, in many cases, the determined lower bound equals the true value of ν. Thanks to the efficiency of the non-smooth technique, the algorithm can be applied to problems involving even a significant number of uncertain parameters. Another appealing feature of the proposed non-smooth approach is that the dimension of repeated scalar uncertainties in the overall structured uncertainty matrix has little impact on the computational time. The technique can be used to compute a lower bound on the structured singular value μ as well. Copyright © 2012 John Wiley & Sons, Ltd.

Ancillary