Structured backward errors for KKT systems (Q1300867): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Changed an Item
Property / describes a project that uses
 
Property / describes a project that uses: mctoolbox / rank
 
Normal rank

Revision as of 05:14, 29 February 2024

scientific article
Language Label Description Also known as
English
Structured backward errors for KKT systems
scientific article

    Statements

    Structured backward errors for KKT systems (English)
    0 references
    0 references
    11 November 1999
    0 references
    Karush-Kuhn-Tucker (KKT) systems are linear systems with coefficient matrices of the form \[ \begin{pmatrix} H & A\\ A^T & 0\end{pmatrix}, \] where \(H\) is symmetric. A normwise structured backward error for KKT systems is defined, and a computable formula of the structured backward error is obtained. Simple examples show that the structured backward error may be arbitrarily larger than the unstructured ones in the worst case, and a stable algorithm for solving KKT systems is not necessarily strongly stable. Consequently, the computable formula of the structured backward error may be useful for testing the strong stability of practical algorithms for solving KKT systems.
    0 references
    Karush-Kuhn-Tucker systems
    0 references
    structured backward error
    0 references
    strong stability
    0 references
    algorithms
    0 references

    Identifiers