Convergence of a subgradient method for computing the bound norm of matrices (Q1057619): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0024-3795(84)90093-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028464528 / rank
 
Normal rank

Revision as of 17:43, 21 March 2024

scientific article
Language Label Description Also known as
English
Convergence of a subgradient method for computing the bound norm of matrices
scientific article

    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

    Identifiers