{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:OCS2SYUUY3YMHE3I3M6UU54AAC","short_pith_number":"pith:OCS2SYUU","schema_version":"1.0","canonical_sha256":"70a5a96294c6f0c39368db3d4a778000a18ca5f848746f8788fee09febfcaa61","source":{"kind":"arxiv","id":"2112.09027","version":1},"attestation_state":"computed","paper":{"title":"A Globally Convergent Distributed Jacobi Scheme for Block-Structured Nonconvex Constrained Optimization Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anirudh Subramanyam, Fran\\c{c}ois Pacaud, Michel Schanen, Mihai Anitescu, Youngdae Kim","submitted_at":"2021-12-16T17:14:39Z","abstract_excerpt":"Motivated by the increasing availability of high-performance parallel computing, we design a distributed parallel algorithm for linearly-coupled block-structured nonconvex constrained optimization problems. Our algorithm performs Jacobi-type proximal updates of the augmented Lagrangian function, requiring only local solutions of separable block nonlinear programming (NLP) problems. We provide a cheap and explicitly computable Lyapunov function that allows us to establish global and local sublinear convergence of our algorithm, its iteration complexity, as well as simple, practical and theoreti"},"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":"2112.09027","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-12-16T17:14:39Z","cross_cats_sorted":[],"title_canon_sha256":"5b00b9ec0f3be7e079e1f76db98d1e0a6c3b78a8bd0771473492bde6c8944e9e","abstract_canon_sha256":"cb7cb9bad9d3d4e94069197d26fa60b1471587504475a2e770cd92f2b17447ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:41:35.249573Z","signature_b64":"tPueSErEJLWjHZNx+1oPw9Ck+g4x47wpKtSsLAQ+RNGyWv6uFCp0ntT3PM+QTmc3Jvk6EwzhzmlIoJ9dwUlWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70a5a96294c6f0c39368db3d4a778000a18ca5f848746f8788fee09febfcaa61","last_reissued_at":"2026-07-05T03:41:35.249185Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:41:35.249185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Globally Convergent Distributed Jacobi Scheme for Block-Structured Nonconvex Constrained Optimization Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anirudh Subramanyam, Fran\\c{c}ois Pacaud, Michel Schanen, Mihai Anitescu, Youngdae Kim","submitted_at":"2021-12-16T17:14:39Z","abstract_excerpt":"Motivated by the increasing availability of high-performance parallel computing, we design a distributed parallel algorithm for linearly-coupled block-structured nonconvex constrained optimization problems. Our algorithm performs Jacobi-type proximal updates of the augmented Lagrangian function, requiring only local solutions of separable block nonlinear programming (NLP) problems. We provide a cheap and explicitly computable Lyapunov function that allows us to establish global and local sublinear convergence of our algorithm, its iteration complexity, as well as simple, practical and theoreti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.09027","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.09027/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2112.09027","created_at":"2026-07-05T03:41:35.249241+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.09027v1","created_at":"2026-07-05T03:41:35.249241+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.09027","created_at":"2026-07-05T03:41:35.249241+00:00"},{"alias_kind":"pith_short_12","alias_value":"OCS2SYUUY3YM","created_at":"2026-07-05T03:41:35.249241+00:00"},{"alias_kind":"pith_short_16","alias_value":"OCS2SYUUY3YMHE3I","created_at":"2026-07-05T03:41:35.249241+00:00"},{"alias_kind":"pith_short_8","alias_value":"OCS2SYUU","created_at":"2026-07-05T03:41:35.249241+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/OCS2SYUUY3YMHE3I3M6UU54AAC","json":"https://pith.science/pith/OCS2SYUUY3YMHE3I3M6UU54AAC.json","graph_json":"https://pith.science/api/pith-number/OCS2SYUUY3YMHE3I3M6UU54AAC/graph.json","events_json":"https://pith.science/api/pith-number/OCS2SYUUY3YMHE3I3M6UU54AAC/events.json","paper":"https://pith.science/paper/OCS2SYUU"},"agent_actions":{"view_html":"https://pith.science/pith/OCS2SYUUY3YMHE3I3M6UU54AAC","download_json":"https://pith.science/pith/OCS2SYUUY3YMHE3I3M6UU54AAC.json","view_paper":"https://pith.science/paper/OCS2SYUU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.09027&json=true","fetch_graph":"https://pith.science/api/pith-number/OCS2SYUUY3YMHE3I3M6UU54AAC/graph.json","fetch_events":"https://pith.science/api/pith-number/OCS2SYUUY3YMHE3I3M6UU54AAC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OCS2SYUUY3YMHE3I3M6UU54AAC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OCS2SYUUY3YMHE3I3M6UU54AAC/action/storage_attestation","attest_author":"https://pith.science/pith/OCS2SYUUY3YMHE3I3M6UU54AAC/action/author_attestation","sign_citation":"https://pith.science/pith/OCS2SYUUY3YMHE3I3M6UU54AAC/action/citation_signature","submit_replication":"https://pith.science/pith/OCS2SYUUY3YMHE3I3M6UU54AAC/action/replication_record"}},"created_at":"2026-07-05T03:41:35.249241+00:00","updated_at":"2026-07-05T03:41:35.249241+00:00"}