A characterization of optimal scaling for structured singular value computation (Q919745)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4162150
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization of optimal scaling for structured singular value computation |
scientific article; zbMATH DE number 4162150 |
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
0 references
0 references
0 references
0 references
0.9115239
0 references
0.90477246
0 references
0.89954126
0 references
0.8952884
0 references
0.89212084
0 references
0.8867315
0 references
0.88456094
0 references
