{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MTA7YQJ4RHWGNOOFVGRADLWRXT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7c9a64ec2d37dd32c30afa624b1e12909fb600c137eb2c5009e36fb2b7a1d403","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-01T13:13:29Z","title_canon_sha256":"abfa4e56cb8db277281f68cdfe9ab4ef2787aa0fd21e1256dbf0224ffc1acd89"},"schema_version":"1.0","source":{"id":"1608.00413","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00413","created_at":"2026-05-18T01:10:11Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00413v1","created_at":"2026-05-18T01:10:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00413","created_at":"2026-05-18T01:10:11Z"},{"alias_kind":"pith_short_12","alias_value":"MTA7YQJ4RHWG","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MTA7YQJ4RHWGNOOF","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MTA7YQJ4","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:4033e8a379a07836858e96103471566653485231256161e38e4777f5a11f990a","target":"graph","created_at":"2026-05-18T01:10:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper, we propose the inexact alternating minimization algorithm (inexact AMA), which allows inexact iterations in the algorithm, and its accelerated variant, called the inexact fast alternating minimization algorithm (inexact FAMA). We show that inexact AMA and inexact FAMA are equivalent to the inexact proximal-gradient method and its accelerated variant applied to the dual problem. Based on this equivalence, we derive complexity upper-bounds on the number of iterations for the inexact algorithms. We apply inexact AMA and inexact FAMA to distributed optimization problems, with an emp","authors_text":"Colin N. Jones, Melanie N. Zeilinger, Ye Pu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-01T13:13:29Z","title":"Inexact Alternating Minimization Algorithm for Distributed Optimization with an Application to Distributed MPC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00413","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:48dd15641cb0add236f416a8886043974f98b737491d10326a5df0f8c4ab85ee","target":"record","created_at":"2026-05-18T01:10:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7c9a64ec2d37dd32c30afa624b1e12909fb600c137eb2c5009e36fb2b7a1d403","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-01T13:13:29Z","title_canon_sha256":"abfa4e56cb8db277281f68cdfe9ab4ef2787aa0fd21e1256dbf0224ffc1acd89"},"schema_version":"1.0","source":{"id":"1608.00413","kind":"arxiv","version":1}},"canonical_sha256":"64c1fc413c89ec66b9c5a9a201aed1bcc9f0853f9afef762a5b616e8f6fe1971","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64c1fc413c89ec66b9c5a9a201aed1bcc9f0853f9afef762a5b616e8f6fe1971","first_computed_at":"2026-05-18T01:10:11.829346Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:11.829346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dGH3yOI7D0lU8Ujd1yVwYdRBAJeCo+VZYOR1JQ5jfwPov+cvNO8aM3r4SzlmANwFklxjOKZ6C23bT5HVkwMcCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:11.829742Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.00413","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48dd15641cb0add236f416a8886043974f98b737491d10326a5df0f8c4ab85ee","sha256:4033e8a379a07836858e96103471566653485231256161e38e4777f5a11f990a"],"state_sha256":"2f301767b4901a0524ce16d0502ff38634e4cfc4dfbc2caf27f1ab901316d48c"}