Computing a Fixed Point of Contraction Maps in Polynomial Queries
We give an algorithm for finding an ε-fixed point of a contraction map f : [0, 1] k \(\mapsto\) [0, 1] k under the \(\ell _\infty\) -norm with query complexity O ( k log (1/ε).
Authors
- Mihalis Yannakakis (ORCID: https://orcid.org/0000-0003-2857-1860)
- Xi Chen (ORCID: https://orcid.org/0000-0001-5661-515X)
- Yuhao Li (ORCID: https://orcid.org/0000-0001-5281-8742)
Institutions
- Columbia University (US)
Publication Details
- Journal
- Journal of the ACM
- Published
- 2025-06-17
- DOI
- https://doi.org/10.1145/3744738
- Primary Topic
- Data Management and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00