Structured backward errors for KKT systems (Q1300867)
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: Structured backward errors for KKT systems |
scientific article; zbMATH DE number 1331335
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Structured backward errors for KKT systems |
scientific article; zbMATH DE number 1331335 |
Statements
Structured backward errors for KKT systems (English)
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
0.9972673
0 references
0.9035321
0 references
0.90263796
0 references
0.8972973
0 references
0.8883909
0 references
0.88502043
0 references