{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EOCP77DI6WFC5RESHR2VBGTNEC","short_pith_number":"pith:EOCP77DI","schema_version":"1.0","canonical_sha256":"2384fffc68f58a2ec4923c75509a6d20ae976bf8817337274f50e75fa2fd9149","source":{"kind":"arxiv","id":"1804.06539","version":2},"attestation_state":"computed","paper":{"title":"Successive Convexification: A Superlinearly Convergent Algorithm for Non-convex Optimal Control Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Behcet Acikmese, Michael Szmuk, Xiangru Xu, Yuanqi Mao","submitted_at":"2018-04-18T03:21:10Z","abstract_excerpt":"This paper presents the SCvx algorithm, a successive convexification algorithm designed to solve non-convex constrained optimal control problems with global convergence and superlinear convergence-rate guarantees. The proposed algorithm can handle nonlinear dynamics and non-convex state and control constraints. It solves the original problem to optimality by successively linearizing non-convex dynamics and constraints about the solution of the previous iteration. The resulting convex subproblems are numerically tractable, and can be computed quickly and reliably using convex optimization solve"},"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":"1804.06539","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-18T03:21:10Z","cross_cats_sorted":[],"title_canon_sha256":"204de2e7f44bde2a8acb0136c51f1c59f8b54146b26d08385a430deb29593b02","abstract_canon_sha256":"38116e2bbd1ae3591ac562de23c660b2e70a5f372b0f6840ffdcacd4c74e3d8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:34.061607Z","signature_b64":"PgY66Ztzga3MqFncsZRYojx+dv1Hi3XkX9txoPNKByQ/h72ZdeBjH1KIfAjchAaaeA2dR/pluOc2PS/LuNlsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2384fffc68f58a2ec4923c75509a6d20ae976bf8817337274f50e75fa2fd9149","last_reissued_at":"2026-05-17T23:52:34.061228Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:34.061228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Successive Convexification: A Superlinearly Convergent Algorithm for Non-convex Optimal Control Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Behcet Acikmese, Michael Szmuk, Xiangru Xu, Yuanqi Mao","submitted_at":"2018-04-18T03:21:10Z","abstract_excerpt":"This paper presents the SCvx algorithm, a successive convexification algorithm designed to solve non-convex constrained optimal control problems with global convergence and superlinear convergence-rate guarantees. The proposed algorithm can handle nonlinear dynamics and non-convex state and control constraints. It solves the original problem to optimality by successively linearizing non-convex dynamics and constraints about the solution of the previous iteration. The resulting convex subproblems are numerically tractable, and can be computed quickly and reliably using convex optimization solve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06539","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":"1804.06539","created_at":"2026-05-17T23:52:34.061284+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.06539v2","created_at":"2026-05-17T23:52:34.061284+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06539","created_at":"2026-05-17T23:52:34.061284+00:00"},{"alias_kind":"pith_short_12","alias_value":"EOCP77DI6WFC","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EOCP77DI6WFC5RES","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EOCP77DI","created_at":"2026-05-18T12:32:22.470017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.23863","citing_title":"Cooptimizing Safety and Performance Using Safety Value-Constrained Model Predictive Control","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EOCP77DI6WFC5RESHR2VBGTNEC","json":"https://pith.science/pith/EOCP77DI6WFC5RESHR2VBGTNEC.json","graph_json":"https://pith.science/api/pith-number/EOCP77DI6WFC5RESHR2VBGTNEC/graph.json","events_json":"https://pith.science/api/pith-number/EOCP77DI6WFC5RESHR2VBGTNEC/events.json","paper":"https://pith.science/paper/EOCP77DI"},"agent_actions":{"view_html":"https://pith.science/pith/EOCP77DI6WFC5RESHR2VBGTNEC","download_json":"https://pith.science/pith/EOCP77DI6WFC5RESHR2VBGTNEC.json","view_paper":"https://pith.science/paper/EOCP77DI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.06539&json=true","fetch_graph":"https://pith.science/api/pith-number/EOCP77DI6WFC5RESHR2VBGTNEC/graph.json","fetch_events":"https://pith.science/api/pith-number/EOCP77DI6WFC5RESHR2VBGTNEC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EOCP77DI6WFC5RESHR2VBGTNEC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EOCP77DI6WFC5RESHR2VBGTNEC/action/storage_attestation","attest_author":"https://pith.science/pith/EOCP77DI6WFC5RESHR2VBGTNEC/action/author_attestation","sign_citation":"https://pith.science/pith/EOCP77DI6WFC5RESHR2VBGTNEC/action/citation_signature","submit_replication":"https://pith.science/pith/EOCP77DI6WFC5RESHR2VBGTNEC/action/replication_record"}},"created_at":"2026-05-17T23:52:34.061284+00:00","updated_at":"2026-05-17T23:52:34.061284+00:00"}