{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KBRBQGG3IL3A2JZMUNX5SR45ZT","short_pith_number":"pith:KBRBQGG3","schema_version":"1.0","canonical_sha256":"50621818db42f60d272ca36fd9479dccc0b8e5c35c8c854e8c6ffe3dd84d35d5","source":{"kind":"arxiv","id":"1406.2192","version":2},"attestation_state":"computed","paper":{"title":"A distributed primal-dual interior-point method for loosely coupled problems using ADMM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anders Hansson, Bo Wahlberg, Mariette Annergren, Sina Khoshfetrat Pakazad","submitted_at":"2014-06-09T14:28:29Z","abstract_excerpt":"In this paper we propose an efficient distributed algorithm for solving loosely coupled convex optimization problems. The algorithm is based on a primal-dual interior-point method in which we use the alternating direction method of multipliers (ADMM) to compute the primal-dual directions at each iteration of the method. This enables us to join the exceptional convergence properties of primal-dual interior-point methods with the remarkable parallelizability of ADMM. The resulting algorithm has superior computational properties with respect to ADMM directly applied to our problem. The amount of "},"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":"1406.2192","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-09T14:28:29Z","cross_cats_sorted":[],"title_canon_sha256":"e67d5bb45ad1cbbcad406fac92eff1d8535c31537e9806bb6ce146ea4e96a2e6","abstract_canon_sha256":"f1a9a3019879438e8dd515a99a1cbbcabd0776f9a28d3de4955c654c9cb5f556"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:44.558572Z","signature_b64":"g/j2nQK1lSwhQMRsXgsnI2OQ93EAxnoan8QRySS6FWn8cS1dkwfWK8nql7j8QlfKuf8r1BNaKaIu/xgHYDEqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50621818db42f60d272ca36fd9479dccc0b8e5c35c8c854e8c6ffe3dd84d35d5","last_reissued_at":"2026-05-18T02:27:44.558111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:44.558111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A distributed primal-dual interior-point method for loosely coupled problems using ADMM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anders Hansson, Bo Wahlberg, Mariette Annergren, Sina Khoshfetrat Pakazad","submitted_at":"2014-06-09T14:28:29Z","abstract_excerpt":"In this paper we propose an efficient distributed algorithm for solving loosely coupled convex optimization problems. The algorithm is based on a primal-dual interior-point method in which we use the alternating direction method of multipliers (ADMM) to compute the primal-dual directions at each iteration of the method. This enables us to join the exceptional convergence properties of primal-dual interior-point methods with the remarkable parallelizability of ADMM. The resulting algorithm has superior computational properties with respect to ADMM directly applied to our problem. The amount of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2192","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":"1406.2192","created_at":"2026-05-18T02:27:44.558173+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.2192v2","created_at":"2026-05-18T02:27:44.558173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2192","created_at":"2026-05-18T02:27:44.558173+00:00"},{"alias_kind":"pith_short_12","alias_value":"KBRBQGG3IL3A","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KBRBQGG3IL3A2JZM","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KBRBQGG3","created_at":"2026-05-18T12:28:35.611951+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/KBRBQGG3IL3A2JZMUNX5SR45ZT","json":"https://pith.science/pith/KBRBQGG3IL3A2JZMUNX5SR45ZT.json","graph_json":"https://pith.science/api/pith-number/KBRBQGG3IL3A2JZMUNX5SR45ZT/graph.json","events_json":"https://pith.science/api/pith-number/KBRBQGG3IL3A2JZMUNX5SR45ZT/events.json","paper":"https://pith.science/paper/KBRBQGG3"},"agent_actions":{"view_html":"https://pith.science/pith/KBRBQGG3IL3A2JZMUNX5SR45ZT","download_json":"https://pith.science/pith/KBRBQGG3IL3A2JZMUNX5SR45ZT.json","view_paper":"https://pith.science/paper/KBRBQGG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.2192&json=true","fetch_graph":"https://pith.science/api/pith-number/KBRBQGG3IL3A2JZMUNX5SR45ZT/graph.json","fetch_events":"https://pith.science/api/pith-number/KBRBQGG3IL3A2JZMUNX5SR45ZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KBRBQGG3IL3A2JZMUNX5SR45ZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KBRBQGG3IL3A2JZMUNX5SR45ZT/action/storage_attestation","attest_author":"https://pith.science/pith/KBRBQGG3IL3A2JZMUNX5SR45ZT/action/author_attestation","sign_citation":"https://pith.science/pith/KBRBQGG3IL3A2JZMUNX5SR45ZT/action/citation_signature","submit_replication":"https://pith.science/pith/KBRBQGG3IL3A2JZMUNX5SR45ZT/action/replication_record"}},"created_at":"2026-05-18T02:27:44.558173+00:00","updated_at":"2026-05-18T02:27:44.558173+00:00"}