{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FRZJ7PMVCWPOOPUFQRCMYMZP2U","short_pith_number":"pith:FRZJ7PMV","schema_version":"1.0","canonical_sha256":"2c729fbd95159ee73e858444cc332fd539613a97cf1c1629de0f6621ad43e55a","source":{"kind":"arxiv","id":"1701.00558","version":2},"attestation_state":"computed","paper":{"title":"Successive Convexification of Non-Convex Optimal Control Problems with State Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Beh\\c{c}et A\\c{c}{\\i}kme\\c{s}e, Daniel Dueri, Michael Szmuk, Yuanqi Mao","submitted_at":"2017-01-03T01:01:15Z","abstract_excerpt":"This paper presents a Successive Convexification ($ \\texttt{SCvx} $) algorithm to solve a class of non-convex optimal control problems with certain types of state constraints. Sources of non-convexity may include nonlinear dynamics and non-convex state/control constraints. To tackle the challenge posed by non-convexity, first we utilize exact penalty function to handle the nonlinear dynamics. Then the proposed algorithm successively convexifies the problem via a $ \\textit{project-and-linearize} $ procedure. Thus a finite dimensional convex programming subproblem is solved at each succession, 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":"1701.00558","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-03T01:01:15Z","cross_cats_sorted":[],"title_canon_sha256":"5e35741b61c4820edc5ddb670f85bc816d82a776c78e9e6eaba466123965882a","abstract_canon_sha256":"6e95a84ab67732cf7a635952fab95101f6e815a6635a2a967f9a0f1bed1c5f52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:25.955504Z","signature_b64":"N3R74VHaFmm5EtVQb+Njz1k1mP3yVH/+r5+93slxenfcfbtbM31q2Hc/y400y/sMLI5ohboaIUkfCv8WY77eDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c729fbd95159ee73e858444cc332fd539613a97cf1c1629de0f6621ad43e55a","last_reissued_at":"2026-05-18T00:32:25.954876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:25.954876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Successive Convexification of Non-Convex Optimal Control Problems with State Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Beh\\c{c}et A\\c{c}{\\i}kme\\c{s}e, Daniel Dueri, Michael Szmuk, Yuanqi Mao","submitted_at":"2017-01-03T01:01:15Z","abstract_excerpt":"This paper presents a Successive Convexification ($ \\texttt{SCvx} $) algorithm to solve a class of non-convex optimal control problems with certain types of state constraints. Sources of non-convexity may include nonlinear dynamics and non-convex state/control constraints. To tackle the challenge posed by non-convexity, first we utilize exact penalty function to handle the nonlinear dynamics. Then the proposed algorithm successively convexifies the problem via a $ \\textit{project-and-linearize} $ procedure. Thus a finite dimensional convex programming subproblem is solved at each succession, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00558","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":"1701.00558","created_at":"2026-05-18T00:32:25.954974+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.00558v2","created_at":"2026-05-18T00:32:25.954974+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00558","created_at":"2026-05-18T00:32:25.954974+00:00"},{"alias_kind":"pith_short_12","alias_value":"FRZJ7PMVCWPO","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FRZJ7PMVCWPOOPUF","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FRZJ7PMV","created_at":"2026-05-18T12:31:15.632608+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/FRZJ7PMVCWPOOPUFQRCMYMZP2U","json":"https://pith.science/pith/FRZJ7PMVCWPOOPUFQRCMYMZP2U.json","graph_json":"https://pith.science/api/pith-number/FRZJ7PMVCWPOOPUFQRCMYMZP2U/graph.json","events_json":"https://pith.science/api/pith-number/FRZJ7PMVCWPOOPUFQRCMYMZP2U/events.json","paper":"https://pith.science/paper/FRZJ7PMV"},"agent_actions":{"view_html":"https://pith.science/pith/FRZJ7PMVCWPOOPUFQRCMYMZP2U","download_json":"https://pith.science/pith/FRZJ7PMVCWPOOPUFQRCMYMZP2U.json","view_paper":"https://pith.science/paper/FRZJ7PMV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.00558&json=true","fetch_graph":"https://pith.science/api/pith-number/FRZJ7PMVCWPOOPUFQRCMYMZP2U/graph.json","fetch_events":"https://pith.science/api/pith-number/FRZJ7PMVCWPOOPUFQRCMYMZP2U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FRZJ7PMVCWPOOPUFQRCMYMZP2U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FRZJ7PMVCWPOOPUFQRCMYMZP2U/action/storage_attestation","attest_author":"https://pith.science/pith/FRZJ7PMVCWPOOPUFQRCMYMZP2U/action/author_attestation","sign_citation":"https://pith.science/pith/FRZJ7PMVCWPOOPUFQRCMYMZP2U/action/citation_signature","submit_replication":"https://pith.science/pith/FRZJ7PMVCWPOOPUFQRCMYMZP2U/action/replication_record"}},"created_at":"2026-05-18T00:32:25.954974+00:00","updated_at":"2026-05-18T00:32:25.954974+00:00"}