{"id":"W1996676734","doi":"10.1007/s10107-013-0633-4","title":"On solving simple bilevel programs with a nonconvex lower level program","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Mathematical optimization; Bilevel optimization; Limit point; Smoothing; Stationary point; Constraint (computer-aided design); Feasible region; Convex optimization; Sequence (biology); Limit (mathematics); Interior point method; Variational inequality; Optimization problem; Regular polygon; Bounded function; Simple (philosophy); Penalty method; Limit of a sequence","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":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002851333,0.0002631092,0.0003021426,0.0001365081,0.0002207977,0.001041273,0.0005954218,0.00008565806,0.0003626011],"category_scores_gemma":[0.0001306994,0.0001784843,0.0001302486,0.0008609645,0.00008442385,0.0006002779,0.000162495,0.0001876567,0.0007085066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005088078,"about_ca_system_score_gemma":0.00005885368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002371658,"about_ca_topic_score_gemma":0.00000553647,"domain_scores_codex":[0.9978411,0.00004926194,0.0004069745,0.0005136663,0.0006415988,0.0005474121],"domain_scores_gemma":[0.99859,0.0001968811,0.0001510336,0.0005431403,0.000277841,0.000241098],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005617965,0.001566803,0.0001755921,0.00007108576,0.00008406521,0.00001010861,0.0003826213,0.0002080824,0.00001100952,0.2245823,0.0002126095,0.7726901],"study_design_scores_gemma":[0.0005528395,0.001018258,0.0004333242,0.0001413436,0.00004171127,0.00002590241,0.00009207772,0.8769525,0.0000709775,0.1176394,0.00244387,0.0005878147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003644996,0.000005094059,0.9892941,0.00157299,0.00003792857,0.001327959,6.809934e-7,0.0006937358,0.003422485],"genre_scores_gemma":[0.4076272,3.37279e-7,0.5910476,0.0002308602,0.00003157614,0.0006431341,0.000009473716,0.0000198307,0.0003900309],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8767444,"threshold_uncertainty_score":0.9999958,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03310765846871954,"score_gpt":0.2614845383108118,"score_spread":0.2283768798420922,"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."}}