{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:23M3W7HOKFMHCOBDRE6HSHSMK2","short_pith_number":"pith:23M3W7HO","schema_version":"1.0","canonical_sha256":"d6d9bb7cee5158713823893c791e4c56895c885c9092c72b74a84ca52975112d","source":{"kind":"arxiv","id":"1410.7933","version":1},"attestation_state":"computed","paper":{"title":"A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Defeng Sun, Kim-Chuan Toh, Min Li","submitted_at":"2014-10-29T11:03:22Z","abstract_excerpt":"In this paper, we present a semi-proximal alternating direction method of multipliers (ADMM) for solving $3$-block separable convex minimization problems with the second block in the objective being a strongly convex function and one coupled linear equation constraint. By choosing the semi-proximal terms properly, we establish the global convergence of the proposed semi-proximal ADMM for the step-length $\\tau \\in (0, (1+\\sqrt{5})/2)$ and the penalty parameter $\\sigma\\in (0, +\\infty)$. In particular, if $\\sigma>0$ is smaller than a certain threshold and the first and third linear operators in t"},"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":"1410.7933","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-29T11:03:22Z","cross_cats_sorted":[],"title_canon_sha256":"a40d6a0b5b4aa61f11072fd6b1f67a091e137a7e9b024b85d7d4324a3891b5a3","abstract_canon_sha256":"b521ff5686b84ba2c9cf31eca60f4738e715e4d9b73c0425125dee74308890a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:40:59.638136Z","signature_b64":"26QTmXuNkVYJYhBDDcyAbpDPQVtyAdi+ak4N3Px9xWkKjOsqXMBdGReKeLNmNzPG8NQpsN4e75HL4T3wTeTaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6d9bb7cee5158713823893c791e4c56895c885c9092c72b74a84ca52975112d","last_reissued_at":"2026-05-18T01:40:59.637332Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:40:59.637332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Defeng Sun, Kim-Chuan Toh, Min Li","submitted_at":"2014-10-29T11:03:22Z","abstract_excerpt":"In this paper, we present a semi-proximal alternating direction method of multipliers (ADMM) for solving $3$-block separable convex minimization problems with the second block in the objective being a strongly convex function and one coupled linear equation constraint. By choosing the semi-proximal terms properly, we establish the global convergence of the proposed semi-proximal ADMM for the step-length $\\tau \\in (0, (1+\\sqrt{5})/2)$ and the penalty parameter $\\sigma\\in (0, +\\infty)$. In particular, if $\\sigma>0$ is smaller than a certain threshold and the first and third linear operators in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7933","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":"1410.7933","created_at":"2026-05-18T01:40:59.637466+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.7933v1","created_at":"2026-05-18T01:40:59.637466+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7933","created_at":"2026-05-18T01:40:59.637466+00:00"},{"alias_kind":"pith_short_12","alias_value":"23M3W7HOKFMH","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"23M3W7HOKFMHCOBD","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"23M3W7HO","created_at":"2026-05-18T12:28:09.283467+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/23M3W7HOKFMHCOBDRE6HSHSMK2","json":"https://pith.science/pith/23M3W7HOKFMHCOBDRE6HSHSMK2.json","graph_json":"https://pith.science/api/pith-number/23M3W7HOKFMHCOBDRE6HSHSMK2/graph.json","events_json":"https://pith.science/api/pith-number/23M3W7HOKFMHCOBDRE6HSHSMK2/events.json","paper":"https://pith.science/paper/23M3W7HO"},"agent_actions":{"view_html":"https://pith.science/pith/23M3W7HOKFMHCOBDRE6HSHSMK2","download_json":"https://pith.science/pith/23M3W7HOKFMHCOBDRE6HSHSMK2.json","view_paper":"https://pith.science/paper/23M3W7HO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.7933&json=true","fetch_graph":"https://pith.science/api/pith-number/23M3W7HOKFMHCOBDRE6HSHSMK2/graph.json","fetch_events":"https://pith.science/api/pith-number/23M3W7HOKFMHCOBDRE6HSHSMK2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/23M3W7HOKFMHCOBDRE6HSHSMK2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/23M3W7HOKFMHCOBDRE6HSHSMK2/action/storage_attestation","attest_author":"https://pith.science/pith/23M3W7HOKFMHCOBDRE6HSHSMK2/action/author_attestation","sign_citation":"https://pith.science/pith/23M3W7HOKFMHCOBDRE6HSHSMK2/action/citation_signature","submit_replication":"https://pith.science/pith/23M3W7HOKFMHCOBDRE6HSHSMK2/action/replication_record"}},"created_at":"2026-05-18T01:40:59.637466+00:00","updated_at":"2026-05-18T01:40:59.637466+00:00"}