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

DOI10.1287/MOOR.7.2.295MaRDI QIDQ3964333zbMATH OpenOpenAlexFDO

Authors 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

calculation of approximate fixed pointfinite combinatorial methodfixed point computationnonmonotonic behaviorrefinement methodsuccession of subproblems

Mathematics Subject Classification ID

Fixed-point and coincidence theorems (topological aspects) (54H25) Numerical computation of solutions to systems of equations (65H10) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cited in

(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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3964333)