{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YMILT3XQ4QBYDF4EX5S4DK5WJ3","short_pith_number":"pith:YMILT3XQ","schema_version":"1.0","canonical_sha256":"c310b9eef0e403819784bf65c1abb64ec4fa5b058c39154540d5cdce781e4330","source":{"kind":"arxiv","id":"1705.08941","version":1},"attestation_state":"computed","paper":{"title":"Dual Dynamic Programming with cut selection: convergence proof and numerical experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Vincent Guigues","submitted_at":"2017-05-24T19:43:09Z","abstract_excerpt":"We consider convex optimization problems formulated using dynamic programming equations. Such problems can be solved using the Dual Dynamic Programming algorithm combined with the Level 1 cut selection strategy or the Territory algorithm to select the most relevant Benders cuts. We propose a limited memory variant of Level 1 and show the convergence of DDP combined with the Territory algorithm, Level 1 or its variant for nonlinear optimization problems. In the special case of linear programs, we show convergence in a finite number of iterations. Numerical simulations illustrate the interest of"},"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.08941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-24T19:43:09Z","cross_cats_sorted":[],"title_canon_sha256":"476294c0982a106558753aa3bf4fdda975a6b3770fa7367f1dcd65cd0c69e2e9","abstract_canon_sha256":"63725d41e26f58a2afc8b83c347ef09e9bc797791cb6b4adbfbd882bbe8eb548"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:42.886796Z","signature_b64":"w7ThJdmr8gc1FRNXYyBRfS2rQq8p74D8Wys8bdOBLcxVmuT4wbaBRo7/w7vjWjWbWpwzsSzZuqQ1+fSgfLONDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c310b9eef0e403819784bf65c1abb64ec4fa5b058c39154540d5cdce781e4330","last_reissued_at":"2026-05-18T00:43:42.886033Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:42.886033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dual Dynamic Programming with cut selection: convergence proof and numerical experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Vincent Guigues","submitted_at":"2017-05-24T19:43:09Z","abstract_excerpt":"We consider convex optimization problems formulated using dynamic programming equations. Such problems can be solved using the Dual Dynamic Programming algorithm combined with the Level 1 cut selection strategy or the Territory algorithm to select the most relevant Benders cuts. We propose a limited memory variant of Level 1 and show the convergence of DDP combined with the Territory algorithm, Level 1 or its variant for nonlinear optimization problems. In the special case of linear programs, we show convergence in a finite number of iterations. Numerical simulations illustrate the interest of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08941","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.08941","created_at":"2026-05-18T00:43:42.886168+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08941v1","created_at":"2026-05-18T00:43:42.886168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08941","created_at":"2026-05-18T00:43:42.886168+00:00"},{"alias_kind":"pith_short_12","alias_value":"YMILT3XQ4QBY","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YMILT3XQ4QBYDF4E","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YMILT3XQ","created_at":"2026-05-18T12:31:56.362134+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/YMILT3XQ4QBYDF4EX5S4DK5WJ3","json":"https://pith.science/pith/YMILT3XQ4QBYDF4EX5S4DK5WJ3.json","graph_json":"https://pith.science/api/pith-number/YMILT3XQ4QBYDF4EX5S4DK5WJ3/graph.json","events_json":"https://pith.science/api/pith-number/YMILT3XQ4QBYDF4EX5S4DK5WJ3/events.json","paper":"https://pith.science/paper/YMILT3XQ"},"agent_actions":{"view_html":"https://pith.science/pith/YMILT3XQ4QBYDF4EX5S4DK5WJ3","download_json":"https://pith.science/pith/YMILT3XQ4QBYDF4EX5S4DK5WJ3.json","view_paper":"https://pith.science/paper/YMILT3XQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08941&json=true","fetch_graph":"https://pith.science/api/pith-number/YMILT3XQ4QBYDF4EX5S4DK5WJ3/graph.json","fetch_events":"https://pith.science/api/pith-number/YMILT3XQ4QBYDF4EX5S4DK5WJ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YMILT3XQ4QBYDF4EX5S4DK5WJ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YMILT3XQ4QBYDF4EX5S4DK5WJ3/action/storage_attestation","attest_author":"https://pith.science/pith/YMILT3XQ4QBYDF4EX5S4DK5WJ3/action/author_attestation","sign_citation":"https://pith.science/pith/YMILT3XQ4QBYDF4EX5S4DK5WJ3/action/citation_signature","submit_replication":"https://pith.science/pith/YMILT3XQ4QBYDF4EX5S4DK5WJ3/action/replication_record"}},"created_at":"2026-05-18T00:43:42.886168+00:00","updated_at":"2026-05-18T00:43:42.886168+00:00"}