{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AMZK34M5ZD72VL6ML5AYSFE6NW","short_pith_number":"pith:AMZK34M5","schema_version":"1.0","canonical_sha256":"0332adf19dc8ffaaafcc5f4189149e6d8be88a8298751259768c35c6d2553ef2","source":{"kind":"arxiv","id":"1810.04059","version":3},"attestation_state":"computed","paper":{"title":"Dynamic Optimization with Convergence Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Eric C. Kerrigan, Martin P. Neuenhofen","submitted_at":"2018-10-09T15:00:06Z","abstract_excerpt":"We present a novel direct transcription method to solve optimization problems subject to nonlinear differential and inequality constraints. We prove convergence of our numerical method under reasonably mild assumptions: boundedness and Lipschitz-continuity of the problem-defining functions. We do not require uniqueness, differentiability or constraint qualifications to hold and we avoid the use of Lagrange multipliers. Our approach differs fundamentally from well-known methods based on collocation; we follow a penalty-barrier approach, where we compute integral quadratic penalties on the equal"},"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":"1810.04059","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-09T15:00:06Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"f479a013cd08e76df72d360d0202af63ef8a503fe50849bf88aaef7bce098997","abstract_canon_sha256":"aa06b85e41d500ea1bf61e20c9a7fc65164591067beb0cd7377ff4d752637d36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T20:13:29.427430Z","signature_b64":"dTJ8OW2ejZRB6rpuT/1W6qNcf68wZa1WDzyBKoRVKKa3uqe04nMG0WGBI0Wuq/O7rBVAP0bEAf/ja6NI5exEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0332adf19dc8ffaaafcc5f4189149e6d8be88a8298751259768c35c6d2553ef2","last_reissued_at":"2026-06-04T20:13:29.426992Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T20:13:29.426992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Optimization with Convergence Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Eric C. Kerrigan, Martin P. Neuenhofen","submitted_at":"2018-10-09T15:00:06Z","abstract_excerpt":"We present a novel direct transcription method to solve optimization problems subject to nonlinear differential and inequality constraints. We prove convergence of our numerical method under reasonably mild assumptions: boundedness and Lipschitz-continuity of the problem-defining functions. We do not require uniqueness, differentiability or constraint qualifications to hold and we avoid the use of Lagrange multipliers. Our approach differs fundamentally from well-known methods based on collocation; we follow a penalty-barrier approach, where we compute integral quadratic penalties on the equal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04059","kind":"arxiv","version":3},"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/1810.04059/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":"1810.04059","created_at":"2026-06-04T20:13:29.427053+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.04059v3","created_at":"2026-06-04T20:13:29.427053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04059","created_at":"2026-06-04T20:13:29.427053+00:00"},{"alias_kind":"pith_short_12","alias_value":"AMZK34M5ZD72","created_at":"2026-06-04T20:13:29.427053+00:00"},{"alias_kind":"pith_short_16","alias_value":"AMZK34M5ZD72VL6M","created_at":"2026-06-04T20:13:29.427053+00:00"},{"alias_kind":"pith_short_8","alias_value":"AMZK34M5","created_at":"2026-06-04T20:13:29.427053+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/AMZK34M5ZD72VL6ML5AYSFE6NW","json":"https://pith.science/pith/AMZK34M5ZD72VL6ML5AYSFE6NW.json","graph_json":"https://pith.science/api/pith-number/AMZK34M5ZD72VL6ML5AYSFE6NW/graph.json","events_json":"https://pith.science/api/pith-number/AMZK34M5ZD72VL6ML5AYSFE6NW/events.json","paper":"https://pith.science/paper/AMZK34M5"},"agent_actions":{"view_html":"https://pith.science/pith/AMZK34M5ZD72VL6ML5AYSFE6NW","download_json":"https://pith.science/pith/AMZK34M5ZD72VL6ML5AYSFE6NW.json","view_paper":"https://pith.science/paper/AMZK34M5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.04059&json=true","fetch_graph":"https://pith.science/api/pith-number/AMZK34M5ZD72VL6ML5AYSFE6NW/graph.json","fetch_events":"https://pith.science/api/pith-number/AMZK34M5ZD72VL6ML5AYSFE6NW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AMZK34M5ZD72VL6ML5AYSFE6NW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AMZK34M5ZD72VL6ML5AYSFE6NW/action/storage_attestation","attest_author":"https://pith.science/pith/AMZK34M5ZD72VL6ML5AYSFE6NW/action/author_attestation","sign_citation":"https://pith.science/pith/AMZK34M5ZD72VL6ML5AYSFE6NW/action/citation_signature","submit_replication":"https://pith.science/pith/AMZK34M5ZD72VL6ML5AYSFE6NW/action/replication_record"}},"created_at":"2026-06-04T20:13:29.427053+00:00","updated_at":"2026-06-04T20:13:29.427053+00:00"}