{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5W32XJIXSZK5G6ZVJU5Q24KFU5","short_pith_number":"pith:5W32XJIX","schema_version":"1.0","canonical_sha256":"edb7aba5179655d37b354d3b0d7145a76e6bece8f1108974d2c7119292226357","source":{"kind":"arxiv","id":"1712.07761","version":1},"attestation_state":"computed","paper":{"title":"High-order convergent Finite-Elements Direct Transcription Method for Constrained Optimal Control Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Martin Peter Neuenhofen","submitted_at":"2017-12-21T01:30:27Z","abstract_excerpt":"In this paper we present a finite element method for the direct transcription of constrained non-linear optimal control problems.\n  We prove that our method converges of high order under mild assumptions. Our analysis uses a regularized penalty-barrier functional. The convergence result is obtained from local strict convexity and Lipschitz-continuity of this functional in the finite-element space.\n  The method is very flexible. Each component of the numerical solution can be discretized with a different mesh. General differential-algebraic constraints of arbitrary index can be treated easily w"},"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":"1712.07761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-12-21T01:30:27Z","cross_cats_sorted":[],"title_canon_sha256":"f990dd6d7b34607f18637d148f1c892c5371d616c5a607ecafc71ffb17481d7f","abstract_canon_sha256":"a0eb6266d64e12a80b8285573901ca3e70b4d0fc7f74f83b485ab0da4d8ea202"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:30.971176Z","signature_b64":"yv634a2He17f/Hn4X3Qr+U/MVl+MO1qAOx5IMcZClpGs6py2FJy6WrtZVsiI1uIZnH/OLMAdPmdypvP749kkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edb7aba5179655d37b354d3b0d7145a76e6bece8f1108974d2c7119292226357","last_reissued_at":"2026-05-18T00:27:30.970550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:30.970550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High-order convergent Finite-Elements Direct Transcription Method for Constrained Optimal Control Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Martin Peter Neuenhofen","submitted_at":"2017-12-21T01:30:27Z","abstract_excerpt":"In this paper we present a finite element method for the direct transcription of constrained non-linear optimal control problems.\n  We prove that our method converges of high order under mild assumptions. Our analysis uses a regularized penalty-barrier functional. The convergence result is obtained from local strict convexity and Lipschitz-continuity of this functional in the finite-element space.\n  The method is very flexible. Each component of the numerical solution can be discretized with a different mesh. General differential-algebraic constraints of arbitrary index can be treated easily w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07761","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":"1712.07761","created_at":"2026-05-18T00:27:30.970646+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.07761v1","created_at":"2026-05-18T00:27:30.970646+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07761","created_at":"2026-05-18T00:27:30.970646+00:00"},{"alias_kind":"pith_short_12","alias_value":"5W32XJIXSZK5","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5W32XJIXSZK5G6ZV","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5W32XJIX","created_at":"2026-05-18T12:31:00.734936+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/5W32XJIXSZK5G6ZVJU5Q24KFU5","json":"https://pith.science/pith/5W32XJIXSZK5G6ZVJU5Q24KFU5.json","graph_json":"https://pith.science/api/pith-number/5W32XJIXSZK5G6ZVJU5Q24KFU5/graph.json","events_json":"https://pith.science/api/pith-number/5W32XJIXSZK5G6ZVJU5Q24KFU5/events.json","paper":"https://pith.science/paper/5W32XJIX"},"agent_actions":{"view_html":"https://pith.science/pith/5W32XJIXSZK5G6ZVJU5Q24KFU5","download_json":"https://pith.science/pith/5W32XJIXSZK5G6ZVJU5Q24KFU5.json","view_paper":"https://pith.science/paper/5W32XJIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.07761&json=true","fetch_graph":"https://pith.science/api/pith-number/5W32XJIXSZK5G6ZVJU5Q24KFU5/graph.json","fetch_events":"https://pith.science/api/pith-number/5W32XJIXSZK5G6ZVJU5Q24KFU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5W32XJIXSZK5G6ZVJU5Q24KFU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5W32XJIXSZK5G6ZVJU5Q24KFU5/action/storage_attestation","attest_author":"https://pith.science/pith/5W32XJIXSZK5G6ZVJU5Q24KFU5/action/author_attestation","sign_citation":"https://pith.science/pith/5W32XJIXSZK5G6ZVJU5Q24KFU5/action/citation_signature","submit_replication":"https://pith.science/pith/5W32XJIXSZK5G6ZVJU5Q24KFU5/action/replication_record"}},"created_at":"2026-05-18T00:27:30.970646+00:00","updated_at":"2026-05-18T00:27:30.970646+00:00"}