{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3NFPGA36XJSPAG6E4KKCHOWGZH","short_pith_number":"pith:3NFPGA36","schema_version":"1.0","canonical_sha256":"db4af3037eba64f01bc4e29423bac6c9e5c850a67ceb4dc62fd6d6615d14da4e","source":{"kind":"arxiv","id":"1604.06282","version":1},"attestation_state":"computed","paper":{"title":"Accelerated Douglas-Rachford methods for the solution of convex-concave saddle-point problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hongpeng Sun, Kristian Bredies","submitted_at":"2016-04-21T12:49:09Z","abstract_excerpt":"We study acceleration and preconditioning strategies for a class of Douglas-Rachford methods aiming at the solution of convex-concave saddle-point problems associated with Fenchel-Rockafellar duality. While the basic iteration converges weakly in Hilbert space with $\\mathcal{O}(1/k)$ ergodic convergence of restricted primal-dual gaps, acceleration can be achieved under strong-convexity assumptions. Namely, if either the primal or dual functional in the saddle-point formulation is strongly convex, then the method can be modified to yield $\\mathcal{O}(1/k^2)$ ergodic convergence. In case of both"},"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":"1604.06282","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-21T12:49:09Z","cross_cats_sorted":[],"title_canon_sha256":"32fa71bf10538944040bc5abc6a18ec63b44dcc2fe3ef7a2992c15c6c2c67ce6","abstract_canon_sha256":"af0d2b2aa754224a1253f5156afb437d5bb86218c974f2ca67fd6fe7a4cfcf86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:32.103904Z","signature_b64":"DD5AgGaud0ERgZkO0r/65arUmho6CEWagQpnn5yAcr9RGnLJMJVbm22s1LFyNv7ysRJOHTaA3zm8gYEVqzTcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db4af3037eba64f01bc4e29423bac6c9e5c850a67ceb4dc62fd6d6615d14da4e","last_reissued_at":"2026-05-18T01:16:32.103168Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:32.103168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerated Douglas-Rachford methods for the solution of convex-concave saddle-point problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hongpeng Sun, Kristian Bredies","submitted_at":"2016-04-21T12:49:09Z","abstract_excerpt":"We study acceleration and preconditioning strategies for a class of Douglas-Rachford methods aiming at the solution of convex-concave saddle-point problems associated with Fenchel-Rockafellar duality. While the basic iteration converges weakly in Hilbert space with $\\mathcal{O}(1/k)$ ergodic convergence of restricted primal-dual gaps, acceleration can be achieved under strong-convexity assumptions. Namely, if either the primal or dual functional in the saddle-point formulation is strongly convex, then the method can be modified to yield $\\mathcal{O}(1/k^2)$ ergodic convergence. In case of both"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06282","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":"1604.06282","created_at":"2026-05-18T01:16:32.103285+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.06282v1","created_at":"2026-05-18T01:16:32.103285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06282","created_at":"2026-05-18T01:16:32.103285+00:00"},{"alias_kind":"pith_short_12","alias_value":"3NFPGA36XJSP","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3NFPGA36XJSPAG6E","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3NFPGA36","created_at":"2026-05-18T12:29:55.572404+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/3NFPGA36XJSPAG6E4KKCHOWGZH","json":"https://pith.science/pith/3NFPGA36XJSPAG6E4KKCHOWGZH.json","graph_json":"https://pith.science/api/pith-number/3NFPGA36XJSPAG6E4KKCHOWGZH/graph.json","events_json":"https://pith.science/api/pith-number/3NFPGA36XJSPAG6E4KKCHOWGZH/events.json","paper":"https://pith.science/paper/3NFPGA36"},"agent_actions":{"view_html":"https://pith.science/pith/3NFPGA36XJSPAG6E4KKCHOWGZH","download_json":"https://pith.science/pith/3NFPGA36XJSPAG6E4KKCHOWGZH.json","view_paper":"https://pith.science/paper/3NFPGA36","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.06282&json=true","fetch_graph":"https://pith.science/api/pith-number/3NFPGA36XJSPAG6E4KKCHOWGZH/graph.json","fetch_events":"https://pith.science/api/pith-number/3NFPGA36XJSPAG6E4KKCHOWGZH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3NFPGA36XJSPAG6E4KKCHOWGZH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3NFPGA36XJSPAG6E4KKCHOWGZH/action/storage_attestation","attest_author":"https://pith.science/pith/3NFPGA36XJSPAG6E4KKCHOWGZH/action/author_attestation","sign_citation":"https://pith.science/pith/3NFPGA36XJSPAG6E4KKCHOWGZH/action/citation_signature","submit_replication":"https://pith.science/pith/3NFPGA36XJSPAG6E4KKCHOWGZH/action/replication_record"}},"created_at":"2026-05-18T01:16:32.103285+00:00","updated_at":"2026-05-18T01:16:32.103285+00:00"}