{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BJZLYC5K6L7L7ADNGQUUSY2HTQ","short_pith_number":"pith:BJZLYC5K","schema_version":"1.0","canonical_sha256":"0a72bc0baaf2febf806d34294963479c356ddca38b829b6e475534a08ac17b14","source":{"kind":"arxiv","id":"1705.11119","version":2},"attestation_state":"computed","paper":{"title":"Complexity Certification of a Distributed Augmented Lagrangian Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michael M. Zavlanos, Nikolaos Chatzipanagiotis, Soomin Lee","submitted_at":"2017-05-31T14:45:02Z","abstract_excerpt":"In this paper we present complexity certification results for a distributed Augmented Lagrangian (AL) algorithm used to solve convex optimization problems involving globally coupled linear constraints. Our method relies on the Accelerated Distributed Augmented Lagrangian (ADAL) algorithm, which can handle the coupled linear constraints in a distributed manner based on local estimates of the AL. We show that the theoretical complexity of ADAL to reach an $\\epsilon$-optimal solution both in terms of suboptimality and infeasibility is $O(\\frac{1}{\\epsilon})$ iterations. Moreover, we provide a val"},"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":"1705.11119","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-31T14:45:02Z","cross_cats_sorted":[],"title_canon_sha256":"0285bbdb4b59d83dc3432e0516e63d0d19df184bb02fe5dafdaf500e5439dc68","abstract_canon_sha256":"61aabf72ab586c38f620ef5b99c4fa2e590dfbd9a274ea75d00f1765f873bb3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:08.058166Z","signature_b64":"C4YuiGVEq0jqkyKtvXCcsYtkdZhIbDXtsKtqquBshtaO5pMXqSdx03wZH1loI24vFTuawR/QQ1lzsP/jnDDyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a72bc0baaf2febf806d34294963479c356ddca38b829b6e475534a08ac17b14","last_reissued_at":"2026-05-18T00:26:08.057546Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:08.057546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity Certification of a Distributed Augmented Lagrangian Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michael M. Zavlanos, Nikolaos Chatzipanagiotis, Soomin Lee","submitted_at":"2017-05-31T14:45:02Z","abstract_excerpt":"In this paper we present complexity certification results for a distributed Augmented Lagrangian (AL) algorithm used to solve convex optimization problems involving globally coupled linear constraints. Our method relies on the Accelerated Distributed Augmented Lagrangian (ADAL) algorithm, which can handle the coupled linear constraints in a distributed manner based on local estimates of the AL. We show that the theoretical complexity of ADAL to reach an $\\epsilon$-optimal solution both in terms of suboptimality and infeasibility is $O(\\frac{1}{\\epsilon})$ iterations. Moreover, we provide a val"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.11119","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":"1705.11119","created_at":"2026-05-18T00:26:08.057636+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.11119v2","created_at":"2026-05-18T00:26:08.057636+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.11119","created_at":"2026-05-18T00:26:08.057636+00:00"},{"alias_kind":"pith_short_12","alias_value":"BJZLYC5K6L7L","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BJZLYC5K6L7L7ADN","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BJZLYC5K","created_at":"2026-05-18T12:31:08.081275+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/BJZLYC5K6L7L7ADNGQUUSY2HTQ","json":"https://pith.science/pith/BJZLYC5K6L7L7ADNGQUUSY2HTQ.json","graph_json":"https://pith.science/api/pith-number/BJZLYC5K6L7L7ADNGQUUSY2HTQ/graph.json","events_json":"https://pith.science/api/pith-number/BJZLYC5K6L7L7ADNGQUUSY2HTQ/events.json","paper":"https://pith.science/paper/BJZLYC5K"},"agent_actions":{"view_html":"https://pith.science/pith/BJZLYC5K6L7L7ADNGQUUSY2HTQ","download_json":"https://pith.science/pith/BJZLYC5K6L7L7ADNGQUUSY2HTQ.json","view_paper":"https://pith.science/paper/BJZLYC5K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.11119&json=true","fetch_graph":"https://pith.science/api/pith-number/BJZLYC5K6L7L7ADNGQUUSY2HTQ/graph.json","fetch_events":"https://pith.science/api/pith-number/BJZLYC5K6L7L7ADNGQUUSY2HTQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BJZLYC5K6L7L7ADNGQUUSY2HTQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BJZLYC5K6L7L7ADNGQUUSY2HTQ/action/storage_attestation","attest_author":"https://pith.science/pith/BJZLYC5K6L7L7ADNGQUUSY2HTQ/action/author_attestation","sign_citation":"https://pith.science/pith/BJZLYC5K6L7L7ADNGQUUSY2HTQ/action/citation_signature","submit_replication":"https://pith.science/pith/BJZLYC5K6L7L7ADNGQUUSY2HTQ/action/replication_record"}},"created_at":"2026-05-18T00:26:08.057636+00:00","updated_at":"2026-05-18T00:26:08.057636+00:00"}