Three improved yersions of scarf's method using conventional subsimplices and allowing eestart and continuation procedures

DOI10.1080/02331938008842662zbMATH Open0448.90071OpenAlexW2137630361MaRDI QIDQ3895256

Hoang Tuy

Publication date: 1980

Published in: Mathematische Operationsforschung und Statistik. Series Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938008842662

zbMATH Keywords

algorithmsfixed point algorithmsLeray-Schauder conditioncontinuation procedureinwardness conditionrestart procedurecomputation of fixed pointsconventional subsimplices

Mathematics Subject Classification ID

Fixed-point and coincidence theorems (topological aspects) (54H25) Mathematical programming (90C99)

This page was built for publication: Three improved yersions of scarf's method using conventional subsimplices and allowing eestart and continuation procedures

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