Complexity of a noninterior path-following method for the linear complementarity problem (Q5959900): Difference between revisions
From MaRDI portal
Latest revision as of 23:10, 3 June 2024
scientific article; zbMATH DE number 1727011
Language | Label | Description | Also known as |
---|---|---|---|
English | Complexity of a noninterior path-following method for the linear complementarity problem |
scientific article; zbMATH DE number 1727011 |
Statements
Complexity of a noninterior path-following method for the linear complementarity problem (English)
0 references
11 April 2002
0 references
Linear complementarity, noninterior path-following methods, complexity of algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references