A new class of infeasible interior-point algorithm for linear complementarity problem (Q5400131): 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.1007/s11859-013-0923-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1988776931 / rank | |||
Normal rank | |||
Revision as of 00:36, 20 March 2024
scientific article; zbMATH DE number 6263953
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new class of infeasible interior-point algorithm for linear complementarity problem |
scientific article; zbMATH DE number 6263953 |
Statements
A new class of infeasible interior-point algorithm for linear complementarity problem (English)
0 references
28 February 2014
0 references
linear complementarity problem
0 references
infeasible interior-point method
0 references
full-Newton step
0 references
polynomial complexity
0 references
