A Refinement Procedure for Computing Fixed Points Using Scarf's Primitive Sets

DOI10.1287/moor.7.2.295zbMath0498.90070OpenAlexW2080893141MaRDI QIDQ3964333

Ludo van der Heyden

Publication date: 1982

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.7.2.295

zbMATH Keywords

fixed point computationnonmonotonic behaviorcalculation of approximate fixed pointfinite combinatorial methodrefinement methodsuccession of subproblems

Mathematics Subject Classification ID

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 (1)

A variable dimension algorithm for the linear complementarity problem

This page was built for publication: A Refinement Procedure for Computing Fixed Points Using Scarf's Primitive Sets