On the computational complexity of piecewise-linear homotopy algorithms
- 1 December 1982
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 24 (1) , 216-224
- https://doi.org/10.1007/bf01585104
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A class of simplicial restart fixed point algorithms without an extra dimensionMathematical Programming, 1981
- Observations on a class of nasty linear complementarity problemsDiscrete Applied Mathematics, 1980
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of EquationsSIAM Review, 1980
- Computational complexity of LCPs associated with positive definite symmetric matricesMathematical Programming, 1979
- A restart algorithm without an artificial level for computing fixed points on unbounded regionsLecture Notes in Mathematics, 1979
- Computational complexity of complementary pivot methodsPublished by Springer Nature ,1978
- The Solution of Systems of Piecewise Linear EquationsMathematics of Operations Research, 1976
- Homotopies for computation of fixed points on unbounded regionsMathematical Programming, 1972
- Homotopies for computation of fixed pointsMathematical Programming, 1972
- An Algorithm for Solving Nonlinear Resistor NetworksBell System Technical Journal, 1965