{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002079613,0.001036488,0.001548013,0.000794443,0.0005721339,0.001578624,0.00147814,0.001182728,0.00435673],"category_scores_gemma":[0.008169236,0.0008100395,0.0009893676,0.0008020587,0.001788781,0.001856752,0.002735015,0.002046456,0.0004603956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001579271,"about_ca_system_score_gemma":0.001756713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00281937,"about_ca_topic_score_gemma":0.003148425,"domain_scores_codex":[0.9988536,0.0005222165,0.00003136522,0.0002009894,0.0002229531,0.000169046],"domain_scores_gemma":[0.9957846,0.003138456,0.0003776316,0.0002420911,0.0002697782,0.0001874362],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001568414,0.00005837194,0.0002632768,0.0001274556,0.00004552354,0.00006953451,0.00008920645,0.8911532,0.001611803,0.09340759,0.001133575,0.01188363],"study_design_scores_gemma":[0.00002025637,0.00005249175,0.00005743891,0.000009057974,0.000007160755,0.00001086429,0.00001855064,0.9629884,0.0004937492,0.03603283,0.0003025321,0.0000067508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05412489,0.000180775,0.9383228,0.000257572,0.0000322557,0.00004726388,0.0001070753,0.0002958853,0.00663145],"genre_scores_gemma":[0.8469721,0.0002484006,0.1435043,0.0001024168,0.00004392591,0.0002969475,0.0002703459,0.0004162387,0.008145362],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00435673,"threshold_uncertainty_score":0.01457477,"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."}}