{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:V7MX236TZ2S4HLFD5O2F77E7WQ","short_pith_number":"pith:V7MX236T","schema_version":"1.0","canonical_sha256":"afd97d6fd3cea5c3aca3ebb45ffc9fb41ea626c36a7fe48e881312a4daf31d8c","source":{"kind":"arxiv","id":"2605.14273","version":1},"attestation_state":"computed","paper":{"title":"Generalized Dual Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Generalized dual decomposition replaces the linear regularizer with a nonlinear one to restore strong duality while keeping parallel subproblem solves in two-stage mixed-integer stochastic programs.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Pengyu Zhang, Ruiwei Jiang","submitted_at":"2026-05-14T02:16:35Z","abstract_excerpt":"We study two-stage stochastic optimization models with mixed-integer decision variables appearing in both stages. For these models, dual decomposition enables parallel computing implementation and can quickly provide a lower bound for the optimal value. However, the lower bound thus obtained is not exact in general due to the lack of strong duality. In this paper, we propose a generalized dual decomposition (GDD) that extends the linear regularizer used in dual decomposition to a general nonlinear one, which still admits parallelization while exhibiting strong duality. By encoding the nonlinea"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.14273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T02:16:35Z","cross_cats_sorted":[],"title_canon_sha256":"fb09c54635444a322876ee09066f21a0a83b1c48b95a93518ac8ed682afc5e89","abstract_canon_sha256":"b55f687bd2df8a52d66940a969abf4edec87815454fc7275e19c9ec8a7a32f4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:10.373413Z","signature_b64":"OvgbBS3Dcz2grY+vFHGEZFjYhQpBW8mvnyiT0Dv2644PTBPAtV610THYEmQcag5woCjq7qJ/ziXUrLsaXU2ACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afd97d6fd3cea5c3aca3ebb45ffc9fb41ea626c36a7fe48e881312a4daf31d8c","last_reissued_at":"2026-05-17T23:39:10.372901Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:10.372901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Dual Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Generalized dual decomposition replaces the linear regularizer with a nonlinear one to restore strong duality while keeping parallel subproblem solves in two-stage mixed-integer stochastic programs.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Pengyu Zhang, Ruiwei Jiang","submitted_at":"2026-05-14T02:16:35Z","abstract_excerpt":"We study two-stage stochastic optimization models with mixed-integer decision variables appearing in both stages. For these models, dual decomposition enables parallel computing implementation and can quickly provide a lower bound for the optimal value. However, the lower bound thus obtained is not exact in general due to the lack of strong duality. In this paper, we propose a generalized dual decomposition (GDD) that extends the linear regularizer used in dual decomposition to a general nonlinear one, which still admits parallelization while exhibiting strong duality. By encoding the nonlinea"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we propose a generalized dual decomposition (GDD) that extends the linear regularizer used in dual decomposition to a general nonlinear one, which still admits parallelization while exhibiting strong duality... we establish the convergence of a GDD algorithm to achieve global optimum.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That nonlinear regularizers can be encoded through parameterization and cutting planes in a way that preserves both parallelizability and strong duality without introducing post-hoc data-dependent choices that invalidate the global-optimality guarantee.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Generalized Dual Decomposition replaces linear regularizers with nonlinear ones in dual decomposition to achieve strong duality and global optimality for mixed-integer two-stage stochastic programs while retaining parallelization.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Generalized dual decomposition replaces the linear regularizer with a nonlinear one to restore strong duality while keeping parallel subproblem solves in two-stage mixed-integer stochastic programs.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"5e05d054898f1bfd30ab3be7776a9295e04a6479c2db0e5b3f611948c2e684a2"},"source":{"id":"2605.14273","kind":"arxiv","version":1},"verdict":{"id":"e8c54fcf-7a78-490e-b25e-ca7223286593","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:49:21.756687Z","strongest_claim":"we propose a generalized dual decomposition (GDD) that extends the linear regularizer used in dual decomposition to a general nonlinear one, which still admits parallelization while exhibiting strong duality... we establish the convergence of a GDD algorithm to achieve global optimum.","one_line_summary":"Generalized Dual Decomposition replaces linear regularizers with nonlinear ones in dual decomposition to achieve strong duality and global optimality for mixed-integer two-stage stochastic programs while retaining parallelization.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That nonlinear regularizers can be encoded through parameterization and cutting planes in a way that preserves both parallelizability and strong duality without introducing post-hoc data-dependent choices that invalidate the global-optimality guarantee.","pith_extraction_headline":"Generalized dual decomposition replaces the linear regularizer with a nonlinear one to restore strong duality while keeping parallel subproblem solves in two-stage mixed-integer stochastic programs."},"references":{"count":17,"sample":[{"doi":"","year":null,"title":"Defineg ′ i(x) := PN i′=1 fi′(x) N −f i(x),∀i∈[N]","work_id":"906402d9-85f9-4e05-a41a-a0d709a5d1d8","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"inf x∈X lim infh(x) = inf x∈X limϵ→0 inf x′∈X∩B(x,ϵ) h(x′) ≥inf x∈X limϵ→0 (inf x′∈X h(x′)) = inf x∈X h(x)","work_id":"e09e17de-8f94-4dcd-ad95-395a00899b34","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Thus inf x∈X h(x) = infx∈X lim infh(x)","work_id":"1d631f4d-2e90-4422-acc5-d0f58a5ca7b7","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Thus,∥c(x i (r))− ˜xi∗∥ ≤ ∥c(xi (r))−x i (r)∥+∥x i (r) − ˜xi∗∥ ≤ ∥xi (R′) −x i (r)∥+∥x i (r) − ˜xi∗∥ ≤ 2ϵ 3 + ϵ 3 =ϵ. It follows that lim inf r→∞ gi(X t(r),x i (r)) = lim inf r→∞ g∗ i (c(xi (r))) (4) ","work_id":"ae7fdeb9-9a8b-4b86-a6ba-a491da8bd9d6","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Zhang and Jiang:Generalized Dual Decomposition 39","work_id":"13dee3c1-82ff-4475-a687-989a946a2125","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":17,"snapshot_sha256":"d5fe11ab4756564efba4239855135204387af85964107206f2b0988049520adf","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"8638753b0ee1312f44314799dc11d1993d330b00b080e3304ae9e6f7ef068c03"},"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":"2605.14273","created_at":"2026-05-17T23:39:10.372974+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14273v1","created_at":"2026-05-17T23:39:10.372974+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14273","created_at":"2026-05-17T23:39:10.372974+00:00"},{"alias_kind":"pith_short_12","alias_value":"V7MX236TZ2S4","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"V7MX236TZ2S4HLFD","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"V7MX236T","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V7MX236TZ2S4HLFD5O2F77E7WQ","json":"https://pith.science/pith/V7MX236TZ2S4HLFD5O2F77E7WQ.json","graph_json":"https://pith.science/api/pith-number/V7MX236TZ2S4HLFD5O2F77E7WQ/graph.json","events_json":"https://pith.science/api/pith-number/V7MX236TZ2S4HLFD5O2F77E7WQ/events.json","paper":"https://pith.science/paper/V7MX236T"},"agent_actions":{"view_html":"https://pith.science/pith/V7MX236TZ2S4HLFD5O2F77E7WQ","download_json":"https://pith.science/pith/V7MX236TZ2S4HLFD5O2F77E7WQ.json","view_paper":"https://pith.science/paper/V7MX236T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14273&json=true","fetch_graph":"https://pith.science/api/pith-number/V7MX236TZ2S4HLFD5O2F77E7WQ/graph.json","fetch_events":"https://pith.science/api/pith-number/V7MX236TZ2S4HLFD5O2F77E7WQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V7MX236TZ2S4HLFD5O2F77E7WQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V7MX236TZ2S4HLFD5O2F77E7WQ/action/storage_attestation","attest_author":"https://pith.science/pith/V7MX236TZ2S4HLFD5O2F77E7WQ/action/author_attestation","sign_citation":"https://pith.science/pith/V7MX236TZ2S4HLFD5O2F77E7WQ/action/citation_signature","submit_replication":"https://pith.science/pith/V7MX236TZ2S4HLFD5O2F77E7WQ/action/replication_record"}},"created_at":"2026-05-17T23:39:10.372974+00:00","updated_at":"2026-05-17T23:39:10.372974+00:00"}