{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LBLOHVVXTCZZZVSDBXFFQ3UIUL","short_pith_number":"pith:LBLOHVVX","schema_version":"1.0","canonical_sha256":"5856e3d6b798b39cd6430dca586e88a2cc1a65244d4f51169a29b917dc8492fd","source":{"kind":"arxiv","id":"1808.08287","version":1},"attestation_state":"computed","paper":{"title":"Convergence of the Augmented Decomposition Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hongsheng Liu, Shu Lu","submitted_at":"2018-08-24T19:45:19Z","abstract_excerpt":"We study the convergence of the Augmented Decomposition Algorithm (ADA) proposed in [32] for solving multi-block separable convex minimization problems subject to linear constraints. We show that the global convergence rate of the exact ADA is o(1/k) under the assumption that there exists a saddle point. We consider the inexact Augmented Decomposition Algorithm (iADA) and establish global and local convergence results under some mild assumptions, by providing a stability result for the maximal monotone operator T associated with the perturbation from both primal and dual perspectives. This res"},"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":"1808.08287","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-24T19:45:19Z","cross_cats_sorted":[],"title_canon_sha256":"c48b185343a6073f623bdd5e00452351e1325d365f8a9681e017f9b38a2eb566","abstract_canon_sha256":"041358b83c035697c7afdc9608911e360a48274439206f54758f7ec59b92b8bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:21.581679Z","signature_b64":"TAU6Ika6P44hnFq4pJ3PVyZi/SghfW1xOIuDuc9dk3NmxlBnbLxs7YpVcZxV1me3Hp4axdunQt+uYlE8gBQTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5856e3d6b798b39cd6430dca586e88a2cc1a65244d4f51169a29b917dc8492fd","last_reissued_at":"2026-05-18T00:07:21.580969Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:21.580969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence of the Augmented Decomposition Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hongsheng Liu, Shu Lu","submitted_at":"2018-08-24T19:45:19Z","abstract_excerpt":"We study the convergence of the Augmented Decomposition Algorithm (ADA) proposed in [32] for solving multi-block separable convex minimization problems subject to linear constraints. We show that the global convergence rate of the exact ADA is o(1/k) under the assumption that there exists a saddle point. We consider the inexact Augmented Decomposition Algorithm (iADA) and establish global and local convergence results under some mild assumptions, by providing a stability result for the maximal monotone operator T associated with the perturbation from both primal and dual perspectives. This res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08287","kind":"arxiv","version":1},"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":"1808.08287","created_at":"2026-05-18T00:07:21.581082+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.08287v1","created_at":"2026-05-18T00:07:21.581082+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08287","created_at":"2026-05-18T00:07:21.581082+00:00"},{"alias_kind":"pith_short_12","alias_value":"LBLOHVVXTCZZ","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"LBLOHVVXTCZZZVSD","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"LBLOHVVX","created_at":"2026-05-18T12:32:33.847187+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/LBLOHVVXTCZZZVSDBXFFQ3UIUL","json":"https://pith.science/pith/LBLOHVVXTCZZZVSDBXFFQ3UIUL.json","graph_json":"https://pith.science/api/pith-number/LBLOHVVXTCZZZVSDBXFFQ3UIUL/graph.json","events_json":"https://pith.science/api/pith-number/LBLOHVVXTCZZZVSDBXFFQ3UIUL/events.json","paper":"https://pith.science/paper/LBLOHVVX"},"agent_actions":{"view_html":"https://pith.science/pith/LBLOHVVXTCZZZVSDBXFFQ3UIUL","download_json":"https://pith.science/pith/LBLOHVVXTCZZZVSDBXFFQ3UIUL.json","view_paper":"https://pith.science/paper/LBLOHVVX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.08287&json=true","fetch_graph":"https://pith.science/api/pith-number/LBLOHVVXTCZZZVSDBXFFQ3UIUL/graph.json","fetch_events":"https://pith.science/api/pith-number/LBLOHVVXTCZZZVSDBXFFQ3UIUL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LBLOHVVXTCZZZVSDBXFFQ3UIUL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LBLOHVVXTCZZZVSDBXFFQ3UIUL/action/storage_attestation","attest_author":"https://pith.science/pith/LBLOHVVXTCZZZVSDBXFFQ3UIUL/action/author_attestation","sign_citation":"https://pith.science/pith/LBLOHVVXTCZZZVSDBXFFQ3UIUL/action/citation_signature","submit_replication":"https://pith.science/pith/LBLOHVVXTCZZZVSDBXFFQ3UIUL/action/replication_record"}},"created_at":"2026-05-18T00:07:21.581082+00:00","updated_at":"2026-05-18T00:07:21.581082+00:00"}