A Homotopy for Solving Large, Sparse and Structured Fixed Point Problems
From MaRDI portal
Publication:3314876
DOI10.1287/moor.8.4.557zbMath0532.65039OpenAlexW2028266231MaRDI QIDQ3314876
Publication date: 1983
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.8.4.557
Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10) Numerical solution of boundary value problems involving ordinary differential equations (65L10)
Related Items
A variable-dimension homotopy on networks for computing linear spatial equilibria ⋮ A better triangulation for Wright's \(2^n\)-ray algorithm ⋮ An Interior-Point Differentiable Path-Following Method to Compute Stationary Equilibria in Stochastic Games ⋮ Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds ⋮ Solving discrete systems of nonlinear equations ⋮ Solving discrete zero point problems ⋮ Efficiency and implementation of simplicial zero point algorithms ⋮ A discrete multivariate mean value theorem with applications ⋮ A variable dimension homotopy for computing spatial equilibria ⋮ Simplicial zero-point algorithms: A unifying description ⋮ Model transform and local parameters. Application to instantaneous attractors ⋮ A variable dimension fixed point algorithm and the orientation of simplices
