Pivotal methods for computing equilibrium points: Unified approach and new restart algorithm
From MaRDI portal
Publication:3962790
DOI10.1007/BF01582109zbMath0497.90059OpenAlexW1966221370MaRDI QIDQ3962790
Publication date: 1979
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582109
homotopy algorithmsrestart algorithmpivotal methodscomputation of equilibrium pointscompletely labelled sets
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Fixed-point and coincidence theorems (topological aspects) (54H25)
Related Items (4)
Parametric fixed point algorithms with applications to economic policy analysis ⋮ Topological degree and the Sperner lemma ⋮ Some computational methods for systems of nonlinear equations and systems of polynomial equations ⋮ No bullying! A playful proof of Brouwer's fixed-point theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A unified approach to complementarity in optimization
- Sandwich method for finding fixed points
- The Solution of Systems of Piecewise Linear Equations
- Homotopies for computation of fixed points
- A generalized complementary pivoting algorithm
- Equilibrium Points of Bimatrix Games
- The Approximation of Fixed Points of a Continuous Mapping
- SIMPLICIAL APPROXIMATION OF FIXED POINTS
- Homotopies for computation of fixed points on unbounded regions
This page was built for publication: Pivotal methods for computing equilibrium points: Unified approach and new restart algorithm