On the computational complexity of piecewise-linear homotopy algorithms (Q4749612): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01585104 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2079908347 / rank | |||
Normal rank | |||
Latest revision as of 08:46, 30 July 2024
scientific article; zbMATH DE number 3805285
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of piecewise-linear homotopy algorithms |
scientific article; zbMATH DE number 3805285 |
Statements
On the computational complexity of piecewise-linear homotopy algorithms (English)
0 references
1982
0 references
computational complexity
0 references
piecewise linear homotopy algorithm
0 references
exponential growth
0 references
linear complementarity problem
0 references
solutions nonlinear equations
0 references
fixed point algorithm
0 references
0 references
0 references
