Convergence of a subgradient method for computing the bound norm of matrices (Q1057619)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Convergence of a subgradient method for computing the bound norm of matrices |
scientific article; zbMATH DE number 3898125
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convergence of a subgradient method for computing the bound norm of matrices |
scientific article; zbMATH DE number 3898125 |
Statements
Convergence of a subgradient method for computing the bound norm of matrices (English)
0 references
1984
0 references
For a linear map \(A: R^ n\to R^ m\), where \(R^ n\) and \(R^ m\) are endowed with norms \(\psi\) and \(\phi\), the bound norm is defined by \(S_{\phi \psi}(A)=\sup \{\phi (Ax):\psi (x)\leq 1\}.\) A subgradient method for computing \(S_{\phi \psi}\) is given and it is shown that it converges if \(\phi\) or \(\psi\) are polyhedral. The paper is written in French.
0 references
nonconvex optimization
0 references
polyhedral norms
0 references
bound norm
0 references
subgradient method
0 references
0 references
0 references
0 references
0.91319793
0 references
0 references
0.9014621
0 references
0.8978159
0 references
0.8958955
0 references
0.8954879
0 references
0.8950675
0 references
0.89264655
0 references