{"paper":{"title":"Nonlinear optimal control via occupation measures and LMI-relaxations","license":"","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christophe Prieur (LAAS), CVUT), Didier Henrion (LAAS, Emmanuel Tr\\'elat (MAPMO), Jean-Bernard Lasserre (LAAS)","submitted_at":"2007-03-13T14:55:54Z","abstract_excerpt":"We consider the class of nonlinear optimal control problems (OCP) with polynomial data, i.e., the differential equation, state and control con- straints and cost are all described by polynomials, and more generally for OCPs with smooth data. In addition, state constraints as well as state and/or action constraints are allowed. We provide a simple hierarchy of LMI (lin- ear matrix inequality)-relaxations whose optimal values form a nondecreasing sequence of lower bounds on the optimal value. Under some convexity assump- tions, the sequence converges to the optimal value of the OCP. Preliminary "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0703377","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"}