{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MATV6RMSVMMYEHCND2ZBGLXNF2","short_pith_number":"pith:MATV6RMS","schema_version":"1.0","canonical_sha256":"60275f4592ab19821c4d1eb2132eed2eabebda71143ef1564a571e503a844d2a","source":{"kind":"arxiv","id":"2206.09462","version":2},"attestation_state":"computed","paper":{"title":"Fast Krasnosel'skii-Mann algorithm with a convergence rate of the fixed point iteration of $o\\left(\\frac{1}{k}\\right)$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Dang-Khoa Nguyen, Radu Ioan Bot","submitted_at":"2022-06-19T18:18:21Z","abstract_excerpt":"The Krasnosel'skii-Mann (KM) algorithm is the most fundamental iterative scheme designed to find a fixed point of an averaged operator in the framework of a real Hilbert space, since it lies at the heart of various numerical algorithms for solving monotone inclusions and convex optimization problems. We enhance the Krasnosel'skii-Mann algorithm with Nesterov's momentum updates and show that the resulting numerical method exhibits a convergence rate for the fixed point residual of $o(1/k)$ while preserving the weak convergence of the iterates to a fixed point of the operator. Numerical experime"},"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":"2206.09462","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-06-19T18:18:21Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"53cec50c4e30ae10083cf0b113a7ffdceba5b882fe419bf390966483a21fb4c7","abstract_canon_sha256":"1b82ebc3b0167b6d13a916c0960577ff4ec47e8a7fc2aa61cfb517edcf94edd6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:44:27.021739Z","signature_b64":"yAE+15jP7OZP9AssRoCvpaywLBmYII9LY2Eeq64Lj2751LslX41mESMuqHoxls8a8cVA5YyIVpruMPLe2//WBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60275f4592ab19821c4d1eb2132eed2eabebda71143ef1564a571e503a844d2a","last_reissued_at":"2026-07-05T06:44:27.021330Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:44:27.021330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Krasnosel'skii-Mann algorithm with a convergence rate of the fixed point iteration of $o\\left(\\frac{1}{k}\\right)$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Dang-Khoa Nguyen, Radu Ioan Bot","submitted_at":"2022-06-19T18:18:21Z","abstract_excerpt":"The Krasnosel'skii-Mann (KM) algorithm is the most fundamental iterative scheme designed to find a fixed point of an averaged operator in the framework of a real Hilbert space, since it lies at the heart of various numerical algorithms for solving monotone inclusions and convex optimization problems. We enhance the Krasnosel'skii-Mann algorithm with Nesterov's momentum updates and show that the resulting numerical method exhibits a convergence rate for the fixed point residual of $o(1/k)$ while preserving the weak convergence of the iterates to a fixed point of the operator. Numerical experime"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.09462","kind":"arxiv","version":2},"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/2206.09462/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":"2206.09462","created_at":"2026-07-05T06:44:27.021391+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.09462v2","created_at":"2026-07-05T06:44:27.021391+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.09462","created_at":"2026-07-05T06:44:27.021391+00:00"},{"alias_kind":"pith_short_12","alias_value":"MATV6RMSVMMY","created_at":"2026-07-05T06:44:27.021391+00:00"},{"alias_kind":"pith_short_16","alias_value":"MATV6RMSVMMYEHCN","created_at":"2026-07-05T06:44:27.021391+00:00"},{"alias_kind":"pith_short_8","alias_value":"MATV6RMS","created_at":"2026-07-05T06:44:27.021391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.04585","citing_title":"Accelerated Extragradient-Type Methods -- Part 2: Generalization and Sublinear Convergence Rates under Co-Hypomonotonicity","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MATV6RMSVMMYEHCND2ZBGLXNF2","json":"https://pith.science/pith/MATV6RMSVMMYEHCND2ZBGLXNF2.json","graph_json":"https://pith.science/api/pith-number/MATV6RMSVMMYEHCND2ZBGLXNF2/graph.json","events_json":"https://pith.science/api/pith-number/MATV6RMSVMMYEHCND2ZBGLXNF2/events.json","paper":"https://pith.science/paper/MATV6RMS"},"agent_actions":{"view_html":"https://pith.science/pith/MATV6RMSVMMYEHCND2ZBGLXNF2","download_json":"https://pith.science/pith/MATV6RMSVMMYEHCND2ZBGLXNF2.json","view_paper":"https://pith.science/paper/MATV6RMS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.09462&json=true","fetch_graph":"https://pith.science/api/pith-number/MATV6RMSVMMYEHCND2ZBGLXNF2/graph.json","fetch_events":"https://pith.science/api/pith-number/MATV6RMSVMMYEHCND2ZBGLXNF2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MATV6RMSVMMYEHCND2ZBGLXNF2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MATV6RMSVMMYEHCND2ZBGLXNF2/action/storage_attestation","attest_author":"https://pith.science/pith/MATV6RMSVMMYEHCND2ZBGLXNF2/action/author_attestation","sign_citation":"https://pith.science/pith/MATV6RMSVMMYEHCND2ZBGLXNF2/action/citation_signature","submit_replication":"https://pith.science/pith/MATV6RMSVMMYEHCND2ZBGLXNF2/action/replication_record"}},"created_at":"2026-07-05T06:44:27.021391+00:00","updated_at":"2026-07-05T06:44:27.021391+00:00"}