{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6TLIMNEQMAOESZPIJ5GYLS5RG5","short_pith_number":"pith:6TLIMNEQ","schema_version":"1.0","canonical_sha256":"f4d6863490601c4965e84f4d85cbb137790b45f0e4987407240f19f4dba21424","source":{"kind":"arxiv","id":"1705.07229","version":1},"attestation_state":"computed","paper":{"title":"Iteration-complexity of a Jacobi-type non-Euclidean ADMM for multi-block linearly constrained nonconvex programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jefferson G. Melo, Renato D. C. Monteiro","submitted_at":"2017-05-20T00:17:56Z","abstract_excerpt":"This paper establishes the iteration-complexity of a Jacobi-type non-Euclidean proximal alternating direction method of multipliers (ADMM) for solving multi-block linearly constrained nonconvex programs. The subproblems of this ADMM variant can be solved in parallel and hence the method has great potential to solve large scale multi-block linearly constrained nonconvex programs. Moreover, our analysis allows the Lagrange multiplier to be updated with a relaxation parameter in the interval (0, 2)."},"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.07229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-20T00:17:56Z","cross_cats_sorted":[],"title_canon_sha256":"2334e161791958faf6d2c0ae97b8bef9a440d243ba61b2cb49a309a868393fda","abstract_canon_sha256":"d01751f89aab6908f74d06114e11725bcbb6a307f5e514d48b2d9b648dbf7002"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:06.264650Z","signature_b64":"aaGvoJmiWwaux6GFxEj0M8uffhfoMyZGrStCj+dQ67T6Xuw7jTwAiIKEmOPp4uDFVQ+yyjOxwizUv7zcdJpIDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4d6863490601c4965e84f4d85cbb137790b45f0e4987407240f19f4dba21424","last_reissued_at":"2026-05-18T00:44:06.263974Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:06.263974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iteration-complexity of a Jacobi-type non-Euclidean ADMM for multi-block linearly constrained nonconvex programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jefferson G. Melo, Renato D. C. Monteiro","submitted_at":"2017-05-20T00:17:56Z","abstract_excerpt":"This paper establishes the iteration-complexity of a Jacobi-type non-Euclidean proximal alternating direction method of multipliers (ADMM) for solving multi-block linearly constrained nonconvex programs. The subproblems of this ADMM variant can be solved in parallel and hence the method has great potential to solve large scale multi-block linearly constrained nonconvex programs. Moreover, our analysis allows the Lagrange multiplier to be updated with a relaxation parameter in the interval (0, 2)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07229","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":"1705.07229","created_at":"2026-05-18T00:44:06.264072+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07229v1","created_at":"2026-05-18T00:44:06.264072+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07229","created_at":"2026-05-18T00:44:06.264072+00:00"},{"alias_kind":"pith_short_12","alias_value":"6TLIMNEQMAOE","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6TLIMNEQMAOESZPI","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6TLIMNEQ","created_at":"2026-05-18T12:31:03.183658+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2407.09927","citing_title":"An Adaptive Proximal ADMM for Nonconvex Linearly Constrained Composite Programs","ref_index":41,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6TLIMNEQMAOESZPIJ5GYLS5RG5","json":"https://pith.science/pith/6TLIMNEQMAOESZPIJ5GYLS5RG5.json","graph_json":"https://pith.science/api/pith-number/6TLIMNEQMAOESZPIJ5GYLS5RG5/graph.json","events_json":"https://pith.science/api/pith-number/6TLIMNEQMAOESZPIJ5GYLS5RG5/events.json","paper":"https://pith.science/paper/6TLIMNEQ"},"agent_actions":{"view_html":"https://pith.science/pith/6TLIMNEQMAOESZPIJ5GYLS5RG5","download_json":"https://pith.science/pith/6TLIMNEQMAOESZPIJ5GYLS5RG5.json","view_paper":"https://pith.science/paper/6TLIMNEQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07229&json=true","fetch_graph":"https://pith.science/api/pith-number/6TLIMNEQMAOESZPIJ5GYLS5RG5/graph.json","fetch_events":"https://pith.science/api/pith-number/6TLIMNEQMAOESZPIJ5GYLS5RG5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6TLIMNEQMAOESZPIJ5GYLS5RG5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6TLIMNEQMAOESZPIJ5GYLS5RG5/action/storage_attestation","attest_author":"https://pith.science/pith/6TLIMNEQMAOESZPIJ5GYLS5RG5/action/author_attestation","sign_citation":"https://pith.science/pith/6TLIMNEQMAOESZPIJ5GYLS5RG5/action/citation_signature","submit_replication":"https://pith.science/pith/6TLIMNEQMAOESZPIJ5GYLS5RG5/action/replication_record"}},"created_at":"2026-05-18T00:44:06.264072+00:00","updated_at":"2026-05-18T00:44:06.264072+00:00"}