{"id":"W1997539213","doi":"10.1007/s10957-006-9029-4","title":"Optimization Techniques for State-Constrained Control and Obstacle Problems","year":2006,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Hamilton–Jacobi–Bellman equation; Minimax; Mathematical optimization; Reachability; Duality (order theory); Bellman equation; Mathematics; State (computer science); Variational inequality; Obstacle; Dynamic programming; Optimal control; Class (philosophy); Computer science; Law; Algorithm","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007588427,0.0001053151,0.0001768231,0.0002019745,0.0002354471,0.0001923861,0.0001673051,0.00005117183,0.00001411348],"category_scores_gemma":[0.00005804148,0.00009258979,0.00005636667,0.0003299809,0.00006631997,0.0006042453,0.0000219102,0.00005973098,2.709284e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001905176,"about_ca_system_score_gemma":0.00005513498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001688279,"about_ca_topic_score_gemma":5.410595e-7,"domain_scores_codex":[0.9990372,0.0000894472,0.0004719592,0.0001681393,0.0001287259,0.0001045509],"domain_scores_gemma":[0.9984661,0.0003065986,0.000473954,0.0001238992,0.0005624297,0.00006698782],"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.00001571863,0.00005605647,0.00004335476,0.000009602087,0.00002606343,1.163031e-7,0.00003967537,0.7349586,0.00007069846,0.2605249,0.00004437986,0.004210781],"study_design_scores_gemma":[0.0007997679,0.00007432971,0.00007849548,0.00001334716,0.00006949344,0.00003446565,0.00002516869,0.9345019,0.0002039759,0.06266241,0.001405202,0.000131471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003596464,0.0002360857,0.9978185,0.001106333,0.00001977015,0.0004294271,0.0000157023,0.00004743199,0.0002907591],"genre_scores_gemma":[0.1183431,0.0002037079,0.8806117,0.0003026639,0.0001154591,0.0001140386,0.00003076334,0.00001244705,0.0002661273],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1995432,"threshold_uncertainty_score":0.3775702,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004767419257291239,"score_gpt":0.222882289590336,"score_spread":0.2181148703330448,"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."}}