{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003228689,0.0008526475,0.00119854,0.000463427,0.0005109578,0.001423623,0.001403152,0.001547697,0.003434134],"category_scores_gemma":[0.01124774,0.0007378855,0.0009197876,0.0007071017,0.001186774,0.002161742,0.001612508,0.002713803,0.0009655129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006164787,"about_ca_system_score_gemma":0.001172037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005174519,"about_ca_topic_score_gemma":0.002533456,"domain_scores_codex":[0.9991367,0.0004527553,0.000040368,0.00008711233,0.0002432844,0.00003972279],"domain_scores_gemma":[0.9944183,0.003984385,0.0001544521,0.0003457071,0.0009668906,0.0001303257],"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.0003528686,0.0001772868,0.0005034915,0.000321426,0.00008291709,0.0001374196,0.0004012119,0.6736961,0.004659612,0.1191705,0.00316592,0.1973312],"study_design_scores_gemma":[0.00001253496,0.00003647487,0.00002439565,0.000009196453,0.00000684357,0.00002470851,0.000008264791,0.991352,0.00074209,0.006789902,0.0009856028,0.000008031378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002331394,0.0002038133,0.9965498,0.00006071961,0.00001873497,0.00001382729,0.000007429982,0.00008797313,0.0007261526],"genre_scores_gemma":[0.1299838,0.0006571963,0.8659523,0.00004626266,0.00005126351,0.0001095392,0.00004546575,0.0002393576,0.002914966],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005174519,"threshold_uncertainty_score":0.01707518,"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."}}