A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition (Q4895564): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/moor.21.2.382 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2070571311 / rank | |||
Normal rank | |||
Latest revision as of 22:50, 19 March 2024
scientific article; zbMATH DE number 935206
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition |
scientific article; zbMATH DE number 935206 |
Statements
A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition (English)
0 references
11 March 1997
0 references
linear complementarity
0 references
interior-point algorithms
0 references
superlinear convergence
0 references
