{"id":"W2007103412","doi":"10.1007/s10589-005-4612-4","title":"A Trust-Region Method for Nonlinear Bilevel Programming: Algorithm and Computational Experience","year":2005,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":160,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"","keywords":"Bilevel optimization; Mathematics; Trust region; Quadratic equation; Nonlinear system; Constraint (computer-aided design); Mathematical optimization; Sequential quadratic programming; Nonlinear programming; Algorithm; Type (biology); Software; Quadratic programming; Applied mathematics; Computer science; Optimization problem; Geometry","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.0001883023,0.0001908077,0.000193475,0.0002322733,0.000549312,0.0003230747,0.0002441031,0.00007802529,0.00001735789],"category_scores_gemma":[0.00003433726,0.0001961279,0.00006510773,0.0006579894,0.00008405258,0.0006057269,0.0001010208,0.00007190475,0.000005810039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004146508,"about_ca_system_score_gemma":0.0001015784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003914052,"about_ca_topic_score_gemma":8.24862e-7,"domain_scores_codex":[0.9984871,0.00004771197,0.0004260557,0.0005788027,0.0002700255,0.0001903214],"domain_scores_gemma":[0.9985294,0.0003438002,0.0002040061,0.0001752805,0.0005757013,0.0001717847],"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.000002282665,0.00008646874,0.0000397227,0.000006688962,0.0000185506,1.050078e-7,0.0002141726,0.7109828,6.490363e-7,0.1064991,0.00009124312,0.1820582],"study_design_scores_gemma":[0.0006589281,0.00002804771,0.000271328,0.000005504466,0.0000217433,0.00003249296,0.00004098362,0.9647809,0.000006624455,0.009333102,0.02459712,0.0002232679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001582318,0.0001094606,0.9936247,0.005200491,0.00002632914,0.0007257902,0.00003796552,0.0001683814,0.00009103909],"genre_scores_gemma":[0.003621142,0.000037449,0.9936104,0.001239926,0.0001532163,0.0006351703,0.0004796462,0.00001588677,0.0002071426],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2537981,"threshold_uncertainty_score":0.7997863,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02269682176659438,"score_gpt":0.3136590209992671,"score_spread":0.2909621992326727,"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."}}