{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DYWU3SZDMJ4FWZ65UXLDCD2RXY","short_pith_number":"pith:DYWU3SZD","schema_version":"1.0","canonical_sha256":"1e2d4dcb2362785b67dda5d6310f51be030e3993f842bc6bac43c37f79548596","source":{"kind":"arxiv","id":"1412.1911","version":2},"attestation_state":"computed","paper":{"title":"A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization","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-12-05T07:50:09Z","abstract_excerpt":"This paper presents a majorized alternating direction method of multipliers (ADMM) with indefinite proximal terms for solving linearly constrained $2$-block convex composite optimization problems with each block in the objective being the sum of a non-smooth convex function and a smooth convex function, i.e., $\\min_{x \\in {\\cal X}, \\; y \\in {\\cal Y}}\\{p(x)+f(x) + q(y)+g(y)\\mid A^* x+B^* y = c\\}$.\n  By choosing the indefinite proximal terms properly, we establish the global convergence and $O(1/k)$ ergodic iteration-complexity of the proposed method for the step-length $\\tau \\in (0, (1+\\sqrt{5}"},"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":"1412.1911","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-12-05T07:50:09Z","cross_cats_sorted":[],"title_canon_sha256":"0fecb0ce036eb53844208556a68d670e62885363a65352c3d506b1d719d94f71","abstract_canon_sha256":"e48792f464b7d284b8958be63176d14747d0a1e119b817b294a77a4faf5c0595"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:40:59.399145Z","signature_b64":"Y0lGyiyny1kcU5V0t/aBwzEi+otn18D9/HRDKJYgUfS4iklRpzNUPJ1TK431dHfd+WWgVEWTHc+ittQFp3o1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e2d4dcb2362785b67dda5d6310f51be030e3993f842bc6bac43c37f79548596","last_reissued_at":"2026-05-18T01:40:59.398546Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:40:59.398546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization","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-12-05T07:50:09Z","abstract_excerpt":"This paper presents a majorized alternating direction method of multipliers (ADMM) with indefinite proximal terms for solving linearly constrained $2$-block convex composite optimization problems with each block in the objective being the sum of a non-smooth convex function and a smooth convex function, i.e., $\\min_{x \\in {\\cal X}, \\; y \\in {\\cal Y}}\\{p(x)+f(x) + q(y)+g(y)\\mid A^* x+B^* y = c\\}$.\n  By choosing the indefinite proximal terms properly, we establish the global convergence and $O(1/k)$ ergodic iteration-complexity of the proposed method for the step-length $\\tau \\in (0, (1+\\sqrt{5}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1911","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":"1412.1911","created_at":"2026-05-18T01:40:59.398635+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.1911v2","created_at":"2026-05-18T01:40:59.398635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1911","created_at":"2026-05-18T01:40:59.398635+00:00"},{"alias_kind":"pith_short_12","alias_value":"DYWU3SZDMJ4F","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DYWU3SZDMJ4FWZ65","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DYWU3SZD","created_at":"2026-05-18T12:28:25.294606+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/DYWU3SZDMJ4FWZ65UXLDCD2RXY","json":"https://pith.science/pith/DYWU3SZDMJ4FWZ65UXLDCD2RXY.json","graph_json":"https://pith.science/api/pith-number/DYWU3SZDMJ4FWZ65UXLDCD2RXY/graph.json","events_json":"https://pith.science/api/pith-number/DYWU3SZDMJ4FWZ65UXLDCD2RXY/events.json","paper":"https://pith.science/paper/DYWU3SZD"},"agent_actions":{"view_html":"https://pith.science/pith/DYWU3SZDMJ4FWZ65UXLDCD2RXY","download_json":"https://pith.science/pith/DYWU3SZDMJ4FWZ65UXLDCD2RXY.json","view_paper":"https://pith.science/paper/DYWU3SZD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.1911&json=true","fetch_graph":"https://pith.science/api/pith-number/DYWU3SZDMJ4FWZ65UXLDCD2RXY/graph.json","fetch_events":"https://pith.science/api/pith-number/DYWU3SZDMJ4FWZ65UXLDCD2RXY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DYWU3SZDMJ4FWZ65UXLDCD2RXY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DYWU3SZDMJ4FWZ65UXLDCD2RXY/action/storage_attestation","attest_author":"https://pith.science/pith/DYWU3SZDMJ4FWZ65UXLDCD2RXY/action/author_attestation","sign_citation":"https://pith.science/pith/DYWU3SZDMJ4FWZ65UXLDCD2RXY/action/citation_signature","submit_replication":"https://pith.science/pith/DYWU3SZDMJ4FWZ65UXLDCD2RXY/action/replication_record"}},"created_at":"2026-05-18T01:40:59.398635+00:00","updated_at":"2026-05-18T01:40:59.398635+00:00"}