{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002064913,0.00138958,0.001775226,0.0007026269,0.0007249207,0.001891523,0.001395506,0.002255389,0.005514376],"category_scores_gemma":[0.00932856,0.001055966,0.001266153,0.001413101,0.002087611,0.00287218,0.00350551,0.002873906,0.0005570695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007955218,"about_ca_system_score_gemma":0.001010543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002151273,"about_ca_topic_score_gemma":0.002571686,"domain_scores_codex":[0.9991006,0.0004534419,0.00003713618,0.0001321474,0.0002043805,0.00007227351],"domain_scores_gemma":[0.9971197,0.002328058,0.0001340505,0.0001555155,0.0001544805,0.0001082316],"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.00009633649,0.000159046,0.0003417954,0.0002755549,0.00004954393,0.00008692784,0.000162253,0.7404262,0.001307674,0.213715,0.00236713,0.04101242],"study_design_scores_gemma":[0.00001170058,0.00002986413,0.00003389824,0.00001283816,0.000005879827,0.00001062343,0.00001322211,0.9350828,0.0001774813,0.06388531,0.0007309836,0.000005459984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01450419,0.0001882465,0.9769531,0.0004036672,0.00005929629,0.00007495932,0.00004643601,0.0001000414,0.00766998],"genre_scores_gemma":[0.3196015,0.0005883798,0.6636315,0.0003958597,0.0001797869,0.0005024292,0.0002115291,0.0003848578,0.01450418],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005514376,"threshold_uncertainty_score":0.01844746,"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."}}