Zobrazit v EDS

Computing a Fixed Point of Contraction Maps in Polynomial Queries.

Uloženo v:
Podrobná bibliografie
Název: Computing a Fixed Point of Contraction Maps in Polynomial Queries.
Autoři: Chen, Xi, Li, Yuhao, Yannakakis, Mihalis
Zdroj: Journal of the ACM; Aug2025, Vol. 72 Issue 4, p1-20, 20p
Témata: FIXED point theory, ALGORITHMS, COMPUTATIONAL complexity, MATHEMATICAL functions, COMPUTATIONAL mathematics, POLYNOMIALS
Abstrakt: 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/ε). [ABSTRACT FROM AUTHOR]
Copyright of Journal of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Databáze: Complementary Index
Popis
Abstrakt:We give an algorithm for finding an ε-fixed point of a contraction map f: [0, 1]<sup>k</sup> \(\mapsto\) [0, 1]<sup>k</sup> under the \(\ell _\infty\) -norm with query complexity O (k log (1/ε). [ABSTRACT FROM AUTHOR]
ISSN:00045411
DOI:10.1145/3744738