{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TUKNO65VWERKZODCGDIAQCRNOZ","short_pith_number":"pith:TUKNO65V","schema_version":"1.0","canonical_sha256":"9d14d77bb5b122acb86230d0080a2d764e238931c42574d56c56d5028be02411","source":{"kind":"arxiv","id":"1408.5120","version":2},"attestation_state":"computed","paper":{"title":"A Parametric Non-Convex Decomposition Algorithm for Real-Time and Distributed NMPC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Colin N. Jones, Jean-Hubert Hours","submitted_at":"2014-08-21T19:49:05Z","abstract_excerpt":"A novel decomposition scheme to solve parametric non-convex programs as they arise in Nonlinear Model Predictive Control (NMPC) is presented. It consists of a fixed number of alternating proximal gradient steps and a dual update per time step. Hence, the proposed approach is attractive in a real-time distributed context. Assuming that the Nonlinear Program (NLP) is semi-algebraic and that its critical points are strongly regular, contraction of the sequence of primal-dual iterates is proven, implying stability of the sub-optimality error, under some mild assumptions. Moreover, it is shown that"},"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":"1408.5120","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-21T19:49:05Z","cross_cats_sorted":[],"title_canon_sha256":"2c9e4c35ce00d0cc4516d46db80874686d7d951db99e32c11628328378b7c174","abstract_canon_sha256":"6075f188d42649d701a13a9c02687945e86083c02a2878dc0f48708653d8e964"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:33.734275Z","signature_b64":"ebJYmFFxluBiia2h4ohLIR3yi5uRs3aym79D6+45voeBmbxDsbvJiAgcLhk5uPw+55zQ5lZyKjK2SEdSkENTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d14d77bb5b122acb86230d0080a2d764e238931c42574d56c56d5028be02411","last_reissued_at":"2026-05-18T02:30:33.733853Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:33.733853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Parametric Non-Convex Decomposition Algorithm for Real-Time and Distributed NMPC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Colin N. Jones, Jean-Hubert Hours","submitted_at":"2014-08-21T19:49:05Z","abstract_excerpt":"A novel decomposition scheme to solve parametric non-convex programs as they arise in Nonlinear Model Predictive Control (NMPC) is presented. It consists of a fixed number of alternating proximal gradient steps and a dual update per time step. Hence, the proposed approach is attractive in a real-time distributed context. Assuming that the Nonlinear Program (NLP) is semi-algebraic and that its critical points are strongly regular, contraction of the sequence of primal-dual iterates is proven, implying stability of the sub-optimality error, under some mild assumptions. Moreover, it is shown that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5120","kind":"arxiv","version":2},"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":"1408.5120","created_at":"2026-05-18T02:30:33.733915+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.5120v2","created_at":"2026-05-18T02:30:33.733915+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5120","created_at":"2026-05-18T02:30:33.733915+00:00"},{"alias_kind":"pith_short_12","alias_value":"TUKNO65VWERK","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"TUKNO65VWERKZODC","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"TUKNO65V","created_at":"2026-05-18T12:28:52.271510+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/TUKNO65VWERKZODCGDIAQCRNOZ","json":"https://pith.science/pith/TUKNO65VWERKZODCGDIAQCRNOZ.json","graph_json":"https://pith.science/api/pith-number/TUKNO65VWERKZODCGDIAQCRNOZ/graph.json","events_json":"https://pith.science/api/pith-number/TUKNO65VWERKZODCGDIAQCRNOZ/events.json","paper":"https://pith.science/paper/TUKNO65V"},"agent_actions":{"view_html":"https://pith.science/pith/TUKNO65VWERKZODCGDIAQCRNOZ","download_json":"https://pith.science/pith/TUKNO65VWERKZODCGDIAQCRNOZ.json","view_paper":"https://pith.science/paper/TUKNO65V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.5120&json=true","fetch_graph":"https://pith.science/api/pith-number/TUKNO65VWERKZODCGDIAQCRNOZ/graph.json","fetch_events":"https://pith.science/api/pith-number/TUKNO65VWERKZODCGDIAQCRNOZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TUKNO65VWERKZODCGDIAQCRNOZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TUKNO65VWERKZODCGDIAQCRNOZ/action/storage_attestation","attest_author":"https://pith.science/pith/TUKNO65VWERKZODCGDIAQCRNOZ/action/author_attestation","sign_citation":"https://pith.science/pith/TUKNO65VWERKZODCGDIAQCRNOZ/action/citation_signature","submit_replication":"https://pith.science/pith/TUKNO65VWERKZODCGDIAQCRNOZ/action/replication_record"}},"created_at":"2026-05-18T02:30:33.733915+00:00","updated_at":"2026-05-18T02:30:33.733915+00:00"}