{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:F2UIFDPGHIGBPAQ72FAPPLMWYX","short_pith_number":"pith:F2UIFDPG","schema_version":"1.0","canonical_sha256":"2ea8828de63a0c17821fd140f7ad96c5c8a646bc542e11fa5e0b2e5c6d759b57","source":{"kind":"arxiv","id":"1805.07336","version":1},"attestation_state":"computed","paper":{"title":"A Partially Inexact Alternating Direction Method of Multipliers and its Iteration-Complexity Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jefferson G. Melo, Max L.N. Goncalves, Vando A. Adona","submitted_at":"2018-05-18T17:37:50Z","abstract_excerpt":"This paper proposes a partially inexact alternating direction method of multipliers for computing approximate solution of a linearly constrained convex optimization problem. This method allows its first subproblem to be solved inexactly using a relative approximate criterion, whereas a proximal term is added to its second subproblem in order to simplify it. A stepsize parameter is included in the updating rule of the Lagrangian multiplier to improve its computational performance.\n  Pointwise and ergodic interation-complexity bounds for the proposed method are established. To the best of our kn"},"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":"1805.07336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-18T17:37:50Z","cross_cats_sorted":[],"title_canon_sha256":"c894a00efd7a5404ba4ad20bf3b4f6845a8c12411102e313199eeed522dec4a1","abstract_canon_sha256":"5e9f01924d4d9e83af678c2a73afc109cb79c2fca67c02b191cb7c7a2544dcde"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:38.510912Z","signature_b64":"ynZ6ijsQcnJi3CM7hfnHZc1xIqKTywAoikCMv65YX02DueYViurixQtA1h2Gv6NNfXshv/2PWt0yQvcZhOg2Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ea8828de63a0c17821fd140f7ad96c5c8a646bc542e11fa5e0b2e5c6d759b57","last_reissued_at":"2026-05-18T00:15:38.510282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:38.510282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Partially Inexact Alternating Direction Method of Multipliers and its Iteration-Complexity Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jefferson G. Melo, Max L.N. Goncalves, Vando A. Adona","submitted_at":"2018-05-18T17:37:50Z","abstract_excerpt":"This paper proposes a partially inexact alternating direction method of multipliers for computing approximate solution of a linearly constrained convex optimization problem. This method allows its first subproblem to be solved inexactly using a relative approximate criterion, whereas a proximal term is added to its second subproblem in order to simplify it. A stepsize parameter is included in the updating rule of the Lagrangian multiplier to improve its computational performance.\n  Pointwise and ergodic interation-complexity bounds for the proposed method are established. To the best of our kn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07336","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":"1805.07336","created_at":"2026-05-18T00:15:38.510394+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.07336v1","created_at":"2026-05-18T00:15:38.510394+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07336","created_at":"2026-05-18T00:15:38.510394+00:00"},{"alias_kind":"pith_short_12","alias_value":"F2UIFDPGHIGB","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"F2UIFDPGHIGBPAQ7","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"F2UIFDPG","created_at":"2026-05-18T12:32:22.470017+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/F2UIFDPGHIGBPAQ72FAPPLMWYX","json":"https://pith.science/pith/F2UIFDPGHIGBPAQ72FAPPLMWYX.json","graph_json":"https://pith.science/api/pith-number/F2UIFDPGHIGBPAQ72FAPPLMWYX/graph.json","events_json":"https://pith.science/api/pith-number/F2UIFDPGHIGBPAQ72FAPPLMWYX/events.json","paper":"https://pith.science/paper/F2UIFDPG"},"agent_actions":{"view_html":"https://pith.science/pith/F2UIFDPGHIGBPAQ72FAPPLMWYX","download_json":"https://pith.science/pith/F2UIFDPGHIGBPAQ72FAPPLMWYX.json","view_paper":"https://pith.science/paper/F2UIFDPG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.07336&json=true","fetch_graph":"https://pith.science/api/pith-number/F2UIFDPGHIGBPAQ72FAPPLMWYX/graph.json","fetch_events":"https://pith.science/api/pith-number/F2UIFDPGHIGBPAQ72FAPPLMWYX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F2UIFDPGHIGBPAQ72FAPPLMWYX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F2UIFDPGHIGBPAQ72FAPPLMWYX/action/storage_attestation","attest_author":"https://pith.science/pith/F2UIFDPGHIGBPAQ72FAPPLMWYX/action/author_attestation","sign_citation":"https://pith.science/pith/F2UIFDPGHIGBPAQ72FAPPLMWYX/action/citation_signature","submit_replication":"https://pith.science/pith/F2UIFDPGHIGBPAQ72FAPPLMWYX/action/replication_record"}},"created_at":"2026-05-18T00:15:38.510394+00:00","updated_at":"2026-05-18T00:15:38.510394+00:00"}