{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VQ7YYY7UMMQKGFCPL65RH7X44W","short_pith_number":"pith:VQ7YYY7U","schema_version":"1.0","canonical_sha256":"ac3f8c63f46320a3144f5fbb13fefce59ba0d7ba0ef73fcd915d504e3a3a0cbb","source":{"kind":"arxiv","id":"2108.10969","version":3},"attestation_state":"computed","paper":{"title":"Optimal error bounds for nonexpansive fixed-point iterations in normed spaces","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Juan Pablo Contreras, Roberto Cominetti","submitted_at":"2021-08-24T21:44:56Z","abstract_excerpt":"This paper investigates optimal error bounds and convergence rates for general Mann iterations for computing fixed-points of non-expansive maps. We look for iterations that achieve the smallest fixed-point residual after $n$ steps, by minimizing a worst-case bound $\\|x^n-Tx^n\\|\\le R_n$ derived from a nested family of optimal transport problems. We prove that this bound is tight so that minimizing $R_n$ yields optimal iterations. Inspired from numerical results we identify iterations that attain the rate $R_n=O(1/n)$, which we also show to be the best possible. In particular, we prove that the "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2108.10969","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2021-08-24T21:44:56Z","cross_cats_sorted":[],"title_canon_sha256":"af688df4869d5239d7a08f126310ba90b65d268d2ec834d9596a21ad5fec6061","abstract_canon_sha256":"9d5705c0af80456c424883f486747b181a2f08a3989500457f864c2a1b3affa2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:22:38.564153Z","signature_b64":"NZBiG1TMrgIesjY60CVPTR1sHS0VoQZ5TWKZrJDAsqp30UrO6KtVtJy9L3+oA1PSkZq288fQpIepV3zJGjbxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac3f8c63f46320a3144f5fbb13fefce59ba0d7ba0ef73fcd915d504e3a3a0cbb","last_reissued_at":"2026-07-05T04:22:38.563680Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:22:38.563680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal error bounds for nonexpansive fixed-point iterations in normed spaces","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Juan Pablo Contreras, Roberto Cominetti","submitted_at":"2021-08-24T21:44:56Z","abstract_excerpt":"This paper investigates optimal error bounds and convergence rates for general Mann iterations for computing fixed-points of non-expansive maps. We look for iterations that achieve the smallest fixed-point residual after $n$ steps, by minimizing a worst-case bound $\\|x^n-Tx^n\\|\\le R_n$ derived from a nested family of optimal transport problems. We prove that this bound is tight so that minimizing $R_n$ yields optimal iterations. Inspired from numerical results we identify iterations that attain the rate $R_n=O(1/n)$, which we also show to be the best possible. In particular, we prove that the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.10969","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2108.10969/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2108.10969","created_at":"2026-07-05T04:22:38.563739+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.10969v3","created_at":"2026-07-05T04:22:38.563739+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.10969","created_at":"2026-07-05T04:22:38.563739+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQ7YYY7UMMQK","created_at":"2026-07-05T04:22:38.563739+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQ7YYY7UMMQKGFCP","created_at":"2026-07-05T04:22:38.563739+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQ7YYY7U","created_at":"2026-07-05T04:22:38.563739+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VQ7YYY7UMMQKGFCPL65RH7X44W","json":"https://pith.science/pith/VQ7YYY7UMMQKGFCPL65RH7X44W.json","graph_json":"https://pith.science/api/pith-number/VQ7YYY7UMMQKGFCPL65RH7X44W/graph.json","events_json":"https://pith.science/api/pith-number/VQ7YYY7UMMQKGFCPL65RH7X44W/events.json","paper":"https://pith.science/paper/VQ7YYY7U"},"agent_actions":{"view_html":"https://pith.science/pith/VQ7YYY7UMMQKGFCPL65RH7X44W","download_json":"https://pith.science/pith/VQ7YYY7UMMQKGFCPL65RH7X44W.json","view_paper":"https://pith.science/paper/VQ7YYY7U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.10969&json=true","fetch_graph":"https://pith.science/api/pith-number/VQ7YYY7UMMQKGFCPL65RH7X44W/graph.json","fetch_events":"https://pith.science/api/pith-number/VQ7YYY7UMMQKGFCPL65RH7X44W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQ7YYY7UMMQKGFCPL65RH7X44W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQ7YYY7UMMQKGFCPL65RH7X44W/action/storage_attestation","attest_author":"https://pith.science/pith/VQ7YYY7UMMQKGFCPL65RH7X44W/action/author_attestation","sign_citation":"https://pith.science/pith/VQ7YYY7UMMQKGFCPL65RH7X44W/action/citation_signature","submit_replication":"https://pith.science/pith/VQ7YYY7UMMQKGFCPL65RH7X44W/action/replication_record"}},"created_at":"2026-07-05T04:22:38.563739+00:00","updated_at":"2026-07-05T04:22:38.563739+00:00"}