A characterization of optimal scaling for structured singular value computation

DOI10.1016/0167-6911(90)90003-DzbMath0707.65024MaRDI QIDQ919745

Nasser M. Khraishi, Abbas Emami-Naeini

Publication date: 1990

Published in: Systems \& Control Letters (Search for Journal in Brave)

zbMATH Keywords

subgradientstructured singular valuecomvex non-differentiable optimizationsteepest-descent-like minimization algorithm

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Convex programming (90C25) Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12)

Cites Work

• On Pre-Conditioning of Matrices
• The largest singular value of e/sup X/A/sub 0/e/sup -X/ is convex on convex sets of commuting matrices
• Principal direction alignment: a geometric framework for the complete solution to the μ-problem
• Characterization and efficient computation of the structured singular value
• A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
• Convex Analysis
• Unnamed Item