{"id":"W2249032529","doi":"10.1016/j.automatica.2015.09.013","title":"Local optimization of dynamic programs with guaranteed satisfaction of path constraints","year":2015,"lang":"en","type":"article","venue":"Automatica","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":70,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Karush–Kuhn–Tucker conditions; Path (computing); Solver; Mathematical optimization; Mathematics; Bounded function; Convergence (economics); Point (geometry); Interior point method; Computer science","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001135006,0.00009392801,0.000197182,0.00005199652,0.00001032128,0.00001036536,0.0000484536,0.00005245362,0.00004324139],"category_scores_gemma":[0.00003509197,0.00007786213,0.00002532963,0.0001924039,0.0001673973,0.0000847851,0.000008345098,0.00004859445,0.000005363358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003154668,"about_ca_system_score_gemma":0.000028092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005038193,"about_ca_topic_score_gemma":0.000003725298,"domain_scores_codex":[0.9993074,0.00001581485,0.0002994991,0.00007193215,0.0001882931,0.0001170618],"domain_scores_gemma":[0.9996123,0.00002719412,0.00007470239,0.000127983,0.00009529854,0.00006250192],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001793446,0.0001212829,0.0002953311,0.0007035284,0.0000915815,0.000002377911,0.00116556,0.8450446,0.0001728134,0.003743401,0.00003633615,0.1486053],"study_design_scores_gemma":[0.0004696877,0.0001263095,0.0001248092,0.0001481534,0.00002986631,0.00001071055,0.0005252946,0.9979428,0.00027038,0.0002570011,0.000007785986,0.0000871887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02737541,0.00002072968,0.9692926,0.00001166038,0.00004061017,0.0002753904,0.000002661687,0.0002855931,0.002695358],"genre_scores_gemma":[0.7794505,0.000002445291,0.2205017,0.000003148557,0.000001754079,0.00001058803,0.000009174802,0.00001581494,0.000004868682],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7520751,"threshold_uncertainty_score":0.3175125,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01068625831921516,"score_gpt":0.2189327711758131,"score_spread":0.2082465128565979,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}