PLALGO
From MaRDI portal
Cited in
(11)- Rudiments of an average case complexity theory for piecewise-linear path following algorithms
- scientific article; zbMATH DE number 3860299 (Why is no real title available?)
- scientific article; zbMATH DE number 1099369 (Why is no real title available?)
- General equilibrium models and homotopy methods
- On the computational complexity of piecewise-linear homotopy algorithms
- MPSGE
- An introduction to the octahedral algorithm for the computation of economic equilibria
- Exponential lower bounds for finding Brouwer fixed points
- An efficient simplicial algorithm for computing a zero of a convex union of smooth functions
- scientific article; zbMATH DE number 3780480 (Why is no real title available?)
- Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's
This page was built for software: PLALGO
