A characterization of optimal scaling for structured singular value computation (Q919745): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:19, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of optimal scaling for structured singular value computation |
scientific article |
Statements
A characterization of optimal scaling for structured singular value computation (English)
0 references
1990
0 references
An upper bound on the structured singular value of a complex matrix can be found by solving a convex non-differentiable optimization problem. A characterization of the subgradient of the non-differentiable function is presented, with the recommendation that it is used in a steepest-descent- like minimization algorithm.
0 references
structured singular value
0 references
comvex non-differentiable optimization
0 references
subgradient
0 references
steepest-descent-like minimization algorithm
0 references
