On the computational complexity of piecewise-linear homotopy algorithms (Q4749612): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:22, 7 February 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
