{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PCYAB35I5HJT6GY5H6W3KCXORM","short_pith_number":"pith:PCYAB35I","schema_version":"1.0","canonical_sha256":"78b000efa8e9d33f1b1d3fadb50aee8b3679f379cd12e9f8e6d400594811ce80","source":{"kind":"arxiv","id":"1608.05133","version":3},"attestation_state":"computed","paper":{"title":"Successive Convexification of Non-Convex Optimal Control Problems and Its Convergence Properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Behcet Acikmese, Michael Szmuk, Yuanqi Mao","submitted_at":"2016-08-17T23:58:54Z","abstract_excerpt":"This paper presents an algorithm to solve non-convex optimal control problems, where non-convexity can arise from nonlinear dynamics, and non-convex state and control constraints. This paper assumes that the state and control constraints are already convex or convexified, the proposed algorithm convexifies the nonlinear dynamics, via a linearization, in a successive manner. Thus at each succession, a convex optimal control subproblem is solved. Since the dynamics are linearized and other constraints are convex, after a discretization, the subproblem can be expressed as a finite dimensional con"},"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":"1608.05133","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-17T23:58:54Z","cross_cats_sorted":[],"title_canon_sha256":"918fa208477a9a07535ec4bae29888468135e6313f068f3105ee0ebb7d58f9b7","abstract_canon_sha256":"736c31a816a3cd22ae8506cbebebae472578856881325bf8fccd2fc15fe296a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:04.916130Z","signature_b64":"A8EDRijJ9D/nVbghsTym74soZ32j28S/JLGoGcHbjRua3YBw7x7I5hBylac5WszVFfXVRfotCGzHWGxW3XzXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78b000efa8e9d33f1b1d3fadb50aee8b3679f379cd12e9f8e6d400594811ce80","last_reissued_at":"2026-05-18T00:45:04.915742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:04.915742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Successive Convexification of Non-Convex Optimal Control Problems and Its Convergence Properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Behcet Acikmese, Michael Szmuk, Yuanqi Mao","submitted_at":"2016-08-17T23:58:54Z","abstract_excerpt":"This paper presents an algorithm to solve non-convex optimal control problems, where non-convexity can arise from nonlinear dynamics, and non-convex state and control constraints. This paper assumes that the state and control constraints are already convex or convexified, the proposed algorithm convexifies the nonlinear dynamics, via a linearization, in a successive manner. Thus at each succession, a convex optimal control subproblem is solved. Since the dynamics are linearized and other constraints are convex, after a discretization, the subproblem can be expressed as a finite dimensional con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05133","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":""},"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":"1608.05133","created_at":"2026-05-18T00:45:04.915802+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.05133v3","created_at":"2026-05-18T00:45:04.915802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05133","created_at":"2026-05-18T00:45:04.915802+00:00"},{"alias_kind":"pith_short_12","alias_value":"PCYAB35I5HJT","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PCYAB35I5HJT6GY5","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PCYAB35I","created_at":"2026-05-18T12:30:39.010887+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/PCYAB35I5HJT6GY5H6W3KCXORM","json":"https://pith.science/pith/PCYAB35I5HJT6GY5H6W3KCXORM.json","graph_json":"https://pith.science/api/pith-number/PCYAB35I5HJT6GY5H6W3KCXORM/graph.json","events_json":"https://pith.science/api/pith-number/PCYAB35I5HJT6GY5H6W3KCXORM/events.json","paper":"https://pith.science/paper/PCYAB35I"},"agent_actions":{"view_html":"https://pith.science/pith/PCYAB35I5HJT6GY5H6W3KCXORM","download_json":"https://pith.science/pith/PCYAB35I5HJT6GY5H6W3KCXORM.json","view_paper":"https://pith.science/paper/PCYAB35I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.05133&json=true","fetch_graph":"https://pith.science/api/pith-number/PCYAB35I5HJT6GY5H6W3KCXORM/graph.json","fetch_events":"https://pith.science/api/pith-number/PCYAB35I5HJT6GY5H6W3KCXORM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PCYAB35I5HJT6GY5H6W3KCXORM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PCYAB35I5HJT6GY5H6W3KCXORM/action/storage_attestation","attest_author":"https://pith.science/pith/PCYAB35I5HJT6GY5H6W3KCXORM/action/author_attestation","sign_citation":"https://pith.science/pith/PCYAB35I5HJT6GY5H6W3KCXORM/action/citation_signature","submit_replication":"https://pith.science/pith/PCYAB35I5HJT6GY5H6W3KCXORM/action/replication_record"}},"created_at":"2026-05-18T00:45:04.915802+00:00","updated_at":"2026-05-18T00:45:04.915802+00:00"}