{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:MD2DCQFK5H5XV676G6JQQG4G5B","short_pith_number":"pith:MD2DCQFK","schema_version":"1.0","canonical_sha256":"60f43140aae9fb7afbfe3793081b86e844d859365643899b07d8b8d4123ae168","source":{"kind":"arxiv","id":"2111.06071","version":1},"attestation_state":"computed","paper":{"title":"Linear convergence of the Douglas-Rachford algorithm via a generic error bound condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Javier Pe\\~na, Juan C. Vera, Luis F. Zuluaga","submitted_at":"2021-11-11T06:35:52Z","abstract_excerpt":"We provide new insight into the convergence properties of the Douglas-Rachford algorithm for the problem $\\min_x \\{f(x)+g(x)\\}$, where $f$ and $g$ are convex functions. Our approach relies on and highlights the natural primal-dual symmetry between the above problem and its Fenchel dual $\\min_{u} \\{ f^*(u) + g_*(u)\\}$ where $g_*(u):=g^*(-u)$. Our main development is to show the linear convergence of the algorithm when a natural error bound condition on the Douglas-Rachford operator holds. We leverage our error bound condition approach to show and estimate the algorithm's linear rate of converge"},"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":"2111.06071","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-11-11T06:35:52Z","cross_cats_sorted":[],"title_canon_sha256":"6c5166902976b0a3320e6ab4619c85fd325417df0713c7946f5e7ac417483cbf","abstract_canon_sha256":"7edbdf1928aadb1f46dd92fc797bd608061fdd8f2c5de93b55936bdfe92f5891"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:30:57.728563Z","signature_b64":"0bbUPDuN/EG7lZsts+pFyxzXJ7Uu1qloGpSnJtSapztSM3jVPXY3vc+vm2rak+qibsZhwAvulMO9BrCQZFJRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60f43140aae9fb7afbfe3793081b86e844d859365643899b07d8b8d4123ae168","last_reissued_at":"2026-07-05T03:30:57.728150Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:30:57.728150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear convergence of the Douglas-Rachford algorithm via a generic error bound condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Javier Pe\\~na, Juan C. Vera, Luis F. Zuluaga","submitted_at":"2021-11-11T06:35:52Z","abstract_excerpt":"We provide new insight into the convergence properties of the Douglas-Rachford algorithm for the problem $\\min_x \\{f(x)+g(x)\\}$, where $f$ and $g$ are convex functions. Our approach relies on and highlights the natural primal-dual symmetry between the above problem and its Fenchel dual $\\min_{u} \\{ f^*(u) + g_*(u)\\}$ where $g_*(u):=g^*(-u)$. Our main development is to show the linear convergence of the algorithm when a natural error bound condition on the Douglas-Rachford operator holds. We leverage our error bound condition approach to show and estimate the algorithm's linear rate of converge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.06071","kind":"arxiv","version":1},"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/2111.06071/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":"2111.06071","created_at":"2026-07-05T03:30:57.728215+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.06071v1","created_at":"2026-07-05T03:30:57.728215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.06071","created_at":"2026-07-05T03:30:57.728215+00:00"},{"alias_kind":"pith_short_12","alias_value":"MD2DCQFK5H5X","created_at":"2026-07-05T03:30:57.728215+00:00"},{"alias_kind":"pith_short_16","alias_value":"MD2DCQFK5H5XV676","created_at":"2026-07-05T03:30:57.728215+00:00"},{"alias_kind":"pith_short_8","alias_value":"MD2DCQFK","created_at":"2026-07-05T03:30:57.728215+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.06676","citing_title":"On the convergence rate of the Douglas-Rachford splitting algorithm","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MD2DCQFK5H5XV676G6JQQG4G5B","json":"https://pith.science/pith/MD2DCQFK5H5XV676G6JQQG4G5B.json","graph_json":"https://pith.science/api/pith-number/MD2DCQFK5H5XV676G6JQQG4G5B/graph.json","events_json":"https://pith.science/api/pith-number/MD2DCQFK5H5XV676G6JQQG4G5B/events.json","paper":"https://pith.science/paper/MD2DCQFK"},"agent_actions":{"view_html":"https://pith.science/pith/MD2DCQFK5H5XV676G6JQQG4G5B","download_json":"https://pith.science/pith/MD2DCQFK5H5XV676G6JQQG4G5B.json","view_paper":"https://pith.science/paper/MD2DCQFK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.06071&json=true","fetch_graph":"https://pith.science/api/pith-number/MD2DCQFK5H5XV676G6JQQG4G5B/graph.json","fetch_events":"https://pith.science/api/pith-number/MD2DCQFK5H5XV676G6JQQG4G5B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MD2DCQFK5H5XV676G6JQQG4G5B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MD2DCQFK5H5XV676G6JQQG4G5B/action/storage_attestation","attest_author":"https://pith.science/pith/MD2DCQFK5H5XV676G6JQQG4G5B/action/author_attestation","sign_citation":"https://pith.science/pith/MD2DCQFK5H5XV676G6JQQG4G5B/action/citation_signature","submit_replication":"https://pith.science/pith/MD2DCQFK5H5XV676G6JQQG4G5B/action/replication_record"}},"created_at":"2026-07-05T03:30:57.728215+00:00","updated_at":"2026-07-05T03:30:57.728215+00:00"}