{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NO5KUVTMVUVBNRFYMKKP2UTU54","short_pith_number":"pith:NO5KUVTM","schema_version":"1.0","canonical_sha256":"6bbaaa566cad2a16c4b86294fd5274ef1b24939ad9379622e97abb383414e85e","source":{"kind":"arxiv","id":"2110.08150","version":2},"attestation_state":"computed","paper":{"title":"Halpern-Type Accelerated and Splitting Algorithms For Monotone Inclusions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Quoc Tran-Dinh, Yang Luo","submitted_at":"2021-10-15T15:26:32Z","abstract_excerpt":"In this paper, we develop a new type of accelerated algorithms to solve some classes of maximally monotone equations as well as monotone inclusions. Instead of using Nesterov's accelerating approach, our methods rely on a so-called Halpern-type fixed-point iteration in [32], and recently exploited by a number of researchers, including [24, 70]. Firstly, we derive a new variant of the anchored extra-gradient scheme in [70] based on Popov's past extra-gradient method to solve a maximally monotone equation $G(x) = 0$. We show that our method achieves the same $\\mathcal{O}(1/k)$ convergence rate ("},"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":"2110.08150","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-10-15T15:26:32Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2b8e711e80a622487d48f77905ff119df6a757f86131f077127645cd5bd1d31b","abstract_canon_sha256":"d5c9928bef3d41e9bd5fa10fd64be1edec24e8e72a597c57a20b612aba1b21ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:38:38.155913Z","signature_b64":"uReqnkcaoEkut5gWwvUkQR6QJPxNd/7z3fNvn0z/ardxSrfoZ3wNgAFzBCmx2DPlVPqn9n47KlhmqymQn5xiAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bbaaa566cad2a16c4b86294fd5274ef1b24939ad9379622e97abb383414e85e","last_reissued_at":"2026-07-05T03:38:38.155380Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:38:38.155380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Halpern-Type Accelerated and Splitting Algorithms For Monotone Inclusions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Quoc Tran-Dinh, Yang Luo","submitted_at":"2021-10-15T15:26:32Z","abstract_excerpt":"In this paper, we develop a new type of accelerated algorithms to solve some classes of maximally monotone equations as well as monotone inclusions. Instead of using Nesterov's accelerating approach, our methods rely on a so-called Halpern-type fixed-point iteration in [32], and recently exploited by a number of researchers, including [24, 70]. Firstly, we derive a new variant of the anchored extra-gradient scheme in [70] based on Popov's past extra-gradient method to solve a maximally monotone equation $G(x) = 0$. We show that our method achieves the same $\\mathcal{O}(1/k)$ convergence rate ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.08150","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/2110.08150/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":"2110.08150","created_at":"2026-07-05T03:38:38.155438+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.08150v2","created_at":"2026-07-05T03:38:38.155438+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.08150","created_at":"2026-07-05T03:38:38.155438+00:00"},{"alias_kind":"pith_short_12","alias_value":"NO5KUVTMVUVB","created_at":"2026-07-05T03:38:38.155438+00:00"},{"alias_kind":"pith_short_16","alias_value":"NO5KUVTMVUVBNRFY","created_at":"2026-07-05T03:38:38.155438+00:00"},{"alias_kind":"pith_short_8","alias_value":"NO5KUVTM","created_at":"2026-07-05T03:38:38.155438+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26077","citing_title":"Toward a Systematic Understanding and Interactive Search of Lyapunov-Style Proofs in Optimization","ref_index":68,"is_internal_anchor":false},{"citing_arxiv_id":"2605.30905","citing_title":"A Unifying View of Anchoring via Operator-Side Tikhonov Regularization","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2203.04869","citing_title":"From Halpern's Fixed-Point Iterations to Nesterov's Accelerated Interpretations for Root-Finding Problems","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09363","citing_title":"Near-Optimal Last-Iterate Convergence for Zero-Sum Games with Bandit Feedback and Opponent Actions","ref_index":152,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17145","citing_title":"Negative Momentum for Convex-Concave Optimization","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02231","citing_title":"A Theory of Composition and Duality of Extremal Optimal Fixed-Point Algorithms","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NO5KUVTMVUVBNRFYMKKP2UTU54","json":"https://pith.science/pith/NO5KUVTMVUVBNRFYMKKP2UTU54.json","graph_json":"https://pith.science/api/pith-number/NO5KUVTMVUVBNRFYMKKP2UTU54/graph.json","events_json":"https://pith.science/api/pith-number/NO5KUVTMVUVBNRFYMKKP2UTU54/events.json","paper":"https://pith.science/paper/NO5KUVTM"},"agent_actions":{"view_html":"https://pith.science/pith/NO5KUVTMVUVBNRFYMKKP2UTU54","download_json":"https://pith.science/pith/NO5KUVTMVUVBNRFYMKKP2UTU54.json","view_paper":"https://pith.science/paper/NO5KUVTM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.08150&json=true","fetch_graph":"https://pith.science/api/pith-number/NO5KUVTMVUVBNRFYMKKP2UTU54/graph.json","fetch_events":"https://pith.science/api/pith-number/NO5KUVTMVUVBNRFYMKKP2UTU54/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NO5KUVTMVUVBNRFYMKKP2UTU54/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NO5KUVTMVUVBNRFYMKKP2UTU54/action/storage_attestation","attest_author":"https://pith.science/pith/NO5KUVTMVUVBNRFYMKKP2UTU54/action/author_attestation","sign_citation":"https://pith.science/pith/NO5KUVTMVUVBNRFYMKKP2UTU54/action/citation_signature","submit_replication":"https://pith.science/pith/NO5KUVTMVUVBNRFYMKKP2UTU54/action/replication_record"}},"created_at":"2026-07-05T03:38:38.155438+00:00","updated_at":"2026-07-05T03:38:38.155438+00:00"}