Convergence behavior of interior-point algorithms (Q689124)
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 behavior of interior-point algorithms |
scientific article; zbMATH DE number 440075
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence behavior of interior-point algorithms |
scientific article; zbMATH DE number 440075 |
Statements
Convergence behavior of interior-point algorithms (English)
0 references
6 December 1993
0 references
The author establishes that many interior point algorithms for linear programming generate a solution sequence in which every limit point satisfies the strict complementarity condition. Each limit point maximizes the number of its nonzero components among all solutions.
0 references
interior point algorithms
0 references
strict complementarity condition
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8698351979255676
0 references
0.8391476273536682
0 references
0.8091416358947754
0 references
0.8091416358947754
0 references
0.8076291680335999
0 references
