{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SL5MY2XRE2JC6RTFZKIKPR65EN","short_pith_number":"pith:SL5MY2XR","schema_version":"1.0","canonical_sha256":"92facc6af126922f4665ca90a7c7dd2351cf1357fbd101649006e7eb98b28ff6","source":{"kind":"arxiv","id":"1411.7288","version":3},"attestation_state":"computed","paper":{"title":"ADMM for Convex Quadratic Programs: Q-Linear Convergence and Infeasibility Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Arvind U. Raghunathan, Stefano Di Cairano","submitted_at":"2014-11-26T16:23:56Z","abstract_excerpt":"In this paper, we analyze the convergence of Alternating Direction Method of Multipliers (ADMM) on convex quadratic programs (QPs) with linear equality and bound constraints. The ADMM formulation alternates between an equality constrained QP and a projection on the bounds. Under the assumptions of (i) positive definiteness of the Hessian of the objective projected on the null space of equality constraints (reduced Hessian), and (ii) linear independence constraint qualification holding at the optimal solution, we derive an upper bound on the rate of convergence to the solution at each iteration"},"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":"1411.7288","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-26T16:23:56Z","cross_cats_sorted":[],"title_canon_sha256":"c9cbcee31cbb291eb72fb64200886182b394f87c03bb4c3364f14e92770a985c","abstract_canon_sha256":"8dc1a6a5a884daf636358ff6d9e90fee718e9e23553f7c985ea31201d2d64299"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:11.590660Z","signature_b64":"dJk+ivBVlDVPS/sXDoAF3JFaaNUueKYKW5ixWpgFTRaedcSF8Fw55GOgTDz7UYcjPah5q3T0+sNvhjJsLRDlDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92facc6af126922f4665ca90a7c7dd2351cf1357fbd101649006e7eb98b28ff6","last_reissued_at":"2026-05-18T01:31:11.590158Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:11.590158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ADMM for Convex Quadratic Programs: Q-Linear Convergence and Infeasibility Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Arvind U. Raghunathan, Stefano Di Cairano","submitted_at":"2014-11-26T16:23:56Z","abstract_excerpt":"In this paper, we analyze the convergence of Alternating Direction Method of Multipliers (ADMM) on convex quadratic programs (QPs) with linear equality and bound constraints. The ADMM formulation alternates between an equality constrained QP and a projection on the bounds. Under the assumptions of (i) positive definiteness of the Hessian of the objective projected on the null space of equality constraints (reduced Hessian), and (ii) linear independence constraint qualification holding at the optimal solution, we derive an upper bound on the rate of convergence to the solution at each iteration"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7288","kind":"arxiv","version":3},"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":"1411.7288","created_at":"2026-05-18T01:31:11.590243+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.7288v3","created_at":"2026-05-18T01:31:11.590243+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7288","created_at":"2026-05-18T01:31:11.590243+00:00"},{"alias_kind":"pith_short_12","alias_value":"SL5MY2XRE2JC","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SL5MY2XRE2JC6RTF","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SL5MY2XR","created_at":"2026-05-18T12:28:49.207871+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/SL5MY2XRE2JC6RTFZKIKPR65EN","json":"https://pith.science/pith/SL5MY2XRE2JC6RTFZKIKPR65EN.json","graph_json":"https://pith.science/api/pith-number/SL5MY2XRE2JC6RTFZKIKPR65EN/graph.json","events_json":"https://pith.science/api/pith-number/SL5MY2XRE2JC6RTFZKIKPR65EN/events.json","paper":"https://pith.science/paper/SL5MY2XR"},"agent_actions":{"view_html":"https://pith.science/pith/SL5MY2XRE2JC6RTFZKIKPR65EN","download_json":"https://pith.science/pith/SL5MY2XRE2JC6RTFZKIKPR65EN.json","view_paper":"https://pith.science/paper/SL5MY2XR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.7288&json=true","fetch_graph":"https://pith.science/api/pith-number/SL5MY2XRE2JC6RTFZKIKPR65EN/graph.json","fetch_events":"https://pith.science/api/pith-number/SL5MY2XRE2JC6RTFZKIKPR65EN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SL5MY2XRE2JC6RTFZKIKPR65EN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SL5MY2XRE2JC6RTFZKIKPR65EN/action/storage_attestation","attest_author":"https://pith.science/pith/SL5MY2XRE2JC6RTFZKIKPR65EN/action/author_attestation","sign_citation":"https://pith.science/pith/SL5MY2XRE2JC6RTFZKIKPR65EN/action/citation_signature","submit_replication":"https://pith.science/pith/SL5MY2XRE2JC6RTFZKIKPR65EN/action/replication_record"}},"created_at":"2026-05-18T01:31:11.590243+00:00","updated_at":"2026-05-18T01:31:11.590243+00:00"}