{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5JXY66YOI4NUAR35JRFDJF7JQZ","short_pith_number":"pith:5JXY66YO","schema_version":"1.0","canonical_sha256":"ea6f8f7b0e471b40477d4c4a3497e98640211e11dcf2df7b7102c4c3377de70f","source":{"kind":"arxiv","id":"1803.10803","version":2},"attestation_state":"computed","paper":{"title":"On the Equivalence of Inexact Proximal ALM and ADMM for a Class of Convex Composite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Defeng Sun, Kim-Chuan Toh, Liang Chen, Xudong Li","submitted_at":"2018-03-28T18:54:14Z","abstract_excerpt":"In this paper, we show that for a class of linearly constrained convex composite optimization problems, an (inexact) symmetric Gauss-Seidel based majorized multi-block proximal alternating direction method of multipliers (ADMM) is equivalent to an {\\em inexact} proximal augmented Lagrangian method (ALM). This equivalence not only provides new perspectives for understanding some ADMM-type algorithms but also supplies meaningful guidelines on implementing them to achieve better computational efficiency. Even for the two-block case, a by-product of this equivalence is the convergence of the whole"},"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":"1803.10803","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-28T18:54:14Z","cross_cats_sorted":[],"title_canon_sha256":"6319a59354867e25c5953638b15d9889fb38b6d3349c8fa1ca7dd61342d68144","abstract_canon_sha256":"d136618e195f26a4dcc2cb7a7346c4f0cbab80cc0ce5648e528541a641308034"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:29.516813Z","signature_b64":"iBZpC/2IoaOmKUlpGlbZD70ARI28cIrWuKZ2vaNaHcG04UD7aTo7sAngZZYs6fpyXp+l1wU5w0C1Gy8iPXAzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea6f8f7b0e471b40477d4c4a3497e98640211e11dcf2df7b7102c4c3377de70f","last_reissued_at":"2026-05-17T23:55:29.516391Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:29.516391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Equivalence of Inexact Proximal ALM and ADMM for a Class of Convex Composite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Defeng Sun, Kim-Chuan Toh, Liang Chen, Xudong Li","submitted_at":"2018-03-28T18:54:14Z","abstract_excerpt":"In this paper, we show that for a class of linearly constrained convex composite optimization problems, an (inexact) symmetric Gauss-Seidel based majorized multi-block proximal alternating direction method of multipliers (ADMM) is equivalent to an {\\em inexact} proximal augmented Lagrangian method (ALM). This equivalence not only provides new perspectives for understanding some ADMM-type algorithms but also supplies meaningful guidelines on implementing them to achieve better computational efficiency. Even for the two-block case, a by-product of this equivalence is the convergence of the whole"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10803","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":""},"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":"1803.10803","created_at":"2026-05-17T23:55:29.516454+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.10803v2","created_at":"2026-05-17T23:55:29.516454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10803","created_at":"2026-05-17T23:55:29.516454+00:00"},{"alias_kind":"pith_short_12","alias_value":"5JXY66YOI4NU","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5JXY66YOI4NUAR35","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5JXY66YO","created_at":"2026-05-18T12:32:08.215937+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/5JXY66YOI4NUAR35JRFDJF7JQZ","json":"https://pith.science/pith/5JXY66YOI4NUAR35JRFDJF7JQZ.json","graph_json":"https://pith.science/api/pith-number/5JXY66YOI4NUAR35JRFDJF7JQZ/graph.json","events_json":"https://pith.science/api/pith-number/5JXY66YOI4NUAR35JRFDJF7JQZ/events.json","paper":"https://pith.science/paper/5JXY66YO"},"agent_actions":{"view_html":"https://pith.science/pith/5JXY66YOI4NUAR35JRFDJF7JQZ","download_json":"https://pith.science/pith/5JXY66YOI4NUAR35JRFDJF7JQZ.json","view_paper":"https://pith.science/paper/5JXY66YO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.10803&json=true","fetch_graph":"https://pith.science/api/pith-number/5JXY66YOI4NUAR35JRFDJF7JQZ/graph.json","fetch_events":"https://pith.science/api/pith-number/5JXY66YOI4NUAR35JRFDJF7JQZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5JXY66YOI4NUAR35JRFDJF7JQZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5JXY66YOI4NUAR35JRFDJF7JQZ/action/storage_attestation","attest_author":"https://pith.science/pith/5JXY66YOI4NUAR35JRFDJF7JQZ/action/author_attestation","sign_citation":"https://pith.science/pith/5JXY66YOI4NUAR35JRFDJF7JQZ/action/citation_signature","submit_replication":"https://pith.science/pith/5JXY66YOI4NUAR35JRFDJF7JQZ/action/replication_record"}},"created_at":"2026-05-17T23:55:29.516454+00:00","updated_at":"2026-05-17T23:55:29.516454+00:00"}