Answers are grounded in this paper and cite their sources.
Observational analysis presents a global fixed-point solver for mappings in simplices, highlighting its gradient-free structure.
In this paper a fixed‐point solver for mappings from a simplex into itself that is gradient‐free, global and requires function evaluations for halving the error is presented, where is the dimension. It is based on topological arguments and uses the constructive proof of the Mazurkewicz–Knaster–Kuratowski lemma when used as part of the proof for Brouwer's fixed‐point theorem.
No takes yet. Share an insight, caveat, or question.
Thilo Moshagen (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: