Optimization and pseudospectra, with applications to robust stability

被引:47
作者
Burke, JV [1 ]
Lewis, AS
Overton, ML
机构
[1] Univ Washington, Dept Math, Seattle, WA 98195 USA
[2] Simon Fraser Univ, Dept Math, Burnaby, BC V5A 1S6, Canada
[3] NYU, Courant Inst Math Sci, New York, NY 10012 USA
关键词
pseudospectrum; eigenvalue optimization; spectral abscissa; nonsmooth analysis; subdifferential regularity; robust optimization; robust control; stability radius; distance to instability; H-infinity norm;
D O I
10.1137/S0895479802402818
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The epsilon-pseudospectrum of a matrix A is the subset of the complex plane consisting of all eigenvalues of all complex matrices within a distance epsilon of A. We are interested in two aspects of "optimization and pseudospectra." The first concerns maximizing the function "real part" over an epsilon-pseudospectrum of a fixed matrix: this defines a function known as the epsilon-pseudospectral abscissa of a matrix. We present a bisection algorithm to compute this function. Our second interest is in minimizing the epsilon-pseudospectral abscissa over a set of feasible matrices. A prerequisite for local optimization of this function is an understanding of its variational properties, the study of which is the main focus of the paper. We show that, in a neighborhood of any nonderogatory matrix, the epsilon-pseudospectral abscissa is a nonsmooth but locally Lipschitz and subdifferentially regular function for sufficiently small epsilon; in fact, it can be expressed locally as the maximum of a finite number of smooth functions. Along the way we obtain an eigenvalue perturbation result: near a nonderogatory matrix, the eigenvalues satisfy a Holder continuity property on matrix space-a property that is well known when only a single perturbation parameter is considered. The pseudospectral abscissa is a powerful modeling tool: not only is it a robust measure of stability, but it also reveals the transient (as opposed to asymptotic) behavior of associated dynamical systems.
引用
收藏
页码:80 / 104
页数:25
相关论文
共 43 条
[1]  
[Anonymous], LECT MODERN CONVEX O, DOI 10.1137/1.9780898718829.ch6
[2]  
Arnold V.I., 1971, R. Math. Surveys, V26, P29, DOI 10.1070/RM1971v026n02ABEH003827
[3]  
Balakrishnan V., 1991, International Journal of Robust and Nonlinear Control, V1, P295, DOI 10.1002/rnc.4590010404
[4]  
Baumgartel H., 1985, ANAL PERTURBATION TH
[5]   NP-hardness of some linear control design problems [J].
Blondel, V ;
Tsitsiklis, JN .
SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1997, 35 (06) :2118-2127
[6]  
Bonnans JF., 2013, PERTURBATION ANAL OP
[7]  
Boyd S., 1989, Mathematics of Control, Signals, and Systems, V2, P207, DOI 10.1007/BF02551385
[8]   A REGULARITY RESULT FOR THE SINGULAR-VALUES OF A TRANSFER-MATRIX AND A QUADRATICALLY CONVERGENT ALGORITHM FOR COMPUTING ITS L-INFINITY-NORM [J].
BOYD, S ;
BALAKRISHNAN, V .
SYSTEMS & CONTROL LETTERS, 1990, 15 (01) :1-7
[9]  
Boyd S., 1994, LINEAR MATRIX INEQUA, DOI https://doi.org/10.1109/jproc.1998.735454
[10]   A curve tracing algorithm for computing the pseudospectrum [J].
Bruhl, M .
BIT NUMERICAL MATHEMATICS, 1996, 36 (03) :441-454