{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HPYNHGTBSYRVLHMDWNA72LWSIG","short_pith_number":"pith:HPYNHGTB","schema_version":"1.0","canonical_sha256":"3bf0d39a619623559d83b341fd2ed241bf2038e7ecab1ef5153216b8ba76b3b0","source":{"kind":"arxiv","id":"1709.05984","version":1},"attestation_state":"computed","paper":{"title":"A convergent relaxation of the Douglas-Rachford algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nguyen Hieu Thao","submitted_at":"2017-09-18T14:46:39Z","abstract_excerpt":"This paper proposes an algorithm for solving structured optimization problems, which covers both the backward-backward and the Douglas-Rachford algorithms as special cases, and analyzes its convergence. The set of fixed points of the algorithm is characterized in several cases. Convergence criteria of the algorithm in terms of general fixed point operators are established. When applying to nonconvex feasibility including the inconsistent case, we prove local linear convergence results under mild assumptions on regularity of individual sets and of the collection of sets which need not intersect"},"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":"1709.05984","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-18T14:46:39Z","cross_cats_sorted":[],"title_canon_sha256":"585332ec0a8dc62ffc62d51e025979170e32558ec9814d79532ee7d3f79e5be1","abstract_canon_sha256":"c454022ff6788368ff7afe26a5d5411b7059606ced07cde7ece4f6bee2a300e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:58.573873Z","signature_b64":"jGTintTqiOiXfMEOiBo2sPh4716gua3MbgsYuJ7xi7QpIZ1wdKCSsome6RwhLRBmjvUFLx1Lk15Idk1FBu7cBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bf0d39a619623559d83b341fd2ed241bf2038e7ecab1ef5153216b8ba76b3b0","last_reissued_at":"2026-05-18T00:34:58.573108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:58.573108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A convergent relaxation of the Douglas-Rachford algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nguyen Hieu Thao","submitted_at":"2017-09-18T14:46:39Z","abstract_excerpt":"This paper proposes an algorithm for solving structured optimization problems, which covers both the backward-backward and the Douglas-Rachford algorithms as special cases, and analyzes its convergence. The set of fixed points of the algorithm is characterized in several cases. Convergence criteria of the algorithm in terms of general fixed point operators are established. When applying to nonconvex feasibility including the inconsistent case, we prove local linear convergence results under mild assumptions on regularity of individual sets and of the collection of sets which need not intersect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05984","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":""},"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":"1709.05984","created_at":"2026-05-18T00:34:58.573252+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.05984v1","created_at":"2026-05-18T00:34:58.573252+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05984","created_at":"2026-05-18T00:34:58.573252+00:00"},{"alias_kind":"pith_short_12","alias_value":"HPYNHGTBSYRV","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HPYNHGTBSYRVLHMD","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HPYNHGTB","created_at":"2026-05-18T12:31:18.294218+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/HPYNHGTBSYRVLHMDWNA72LWSIG","json":"https://pith.science/pith/HPYNHGTBSYRVLHMDWNA72LWSIG.json","graph_json":"https://pith.science/api/pith-number/HPYNHGTBSYRVLHMDWNA72LWSIG/graph.json","events_json":"https://pith.science/api/pith-number/HPYNHGTBSYRVLHMDWNA72LWSIG/events.json","paper":"https://pith.science/paper/HPYNHGTB"},"agent_actions":{"view_html":"https://pith.science/pith/HPYNHGTBSYRVLHMDWNA72LWSIG","download_json":"https://pith.science/pith/HPYNHGTBSYRVLHMDWNA72LWSIG.json","view_paper":"https://pith.science/paper/HPYNHGTB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.05984&json=true","fetch_graph":"https://pith.science/api/pith-number/HPYNHGTBSYRVLHMDWNA72LWSIG/graph.json","fetch_events":"https://pith.science/api/pith-number/HPYNHGTBSYRVLHMDWNA72LWSIG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HPYNHGTBSYRVLHMDWNA72LWSIG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HPYNHGTBSYRVLHMDWNA72LWSIG/action/storage_attestation","attest_author":"https://pith.science/pith/HPYNHGTBSYRVLHMDWNA72LWSIG/action/author_attestation","sign_citation":"https://pith.science/pith/HPYNHGTBSYRVLHMDWNA72LWSIG/action/citation_signature","submit_replication":"https://pith.science/pith/HPYNHGTBSYRVLHMDWNA72LWSIG/action/replication_record"}},"created_at":"2026-05-18T00:34:58.573252+00:00","updated_at":"2026-05-18T00:34:58.573252+00:00"}