{"id":"W1975786171","doi":"10.1007/s10589-013-9627-7","title":"A smoothing augmented Lagrangian method for solving simple bilevel programs","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Augmented Lagrangian method; Karush–Kuhn–Tucker conditions; Mathematical optimization; Smoothing; Mathematics; Bilevel optimization; Simple (philosophy); Lagrangian relaxation; Penalty method; Optimization problem; Limit point; Bounded function; Constraint (computer-aided design); Bellman equation","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.0002043166,0.0001489928,0.0001566662,0.0001978227,0.0005121161,0.0005056267,0.0002814719,0.00006109089,0.00008706852],"category_scores_gemma":[0.00003548455,0.000147482,0.00007862408,0.0007608918,0.00003009268,0.0006501033,0.00008703266,0.00005863237,0.00002297539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003530965,"about_ca_system_score_gemma":0.00007044007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003038403,"about_ca_topic_score_gemma":0.000002461429,"domain_scores_codex":[0.9987726,0.00003605639,0.0003589894,0.0004256126,0.0002144761,0.000192228],"domain_scores_gemma":[0.9985567,0.0002751685,0.0001787461,0.0001991607,0.0006526631,0.0001375633],"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":[7.927476e-7,0.00007211683,0.00006962502,0.00001078981,0.00002909126,3.125361e-8,0.00009693053,0.7628666,0.00001782865,0.1931648,0.0003588366,0.04331253],"study_design_scores_gemma":[0.0003991554,0.00001847527,0.0004268214,0.000005558653,0.00001901746,0.000003405014,0.00003402575,0.9548444,0.0000113986,0.04056626,0.003499894,0.0001715548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001745904,0.0000371153,0.9943055,0.003889741,0.00002626787,0.001125374,0.00001236668,0.0002240095,0.0003621865],"genre_scores_gemma":[0.02260544,0.00001026117,0.9739094,0.001175269,0.00006382598,0.001345203,0.0006472269,0.00001515762,0.0002282159],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1919778,"threshold_uncertainty_score":0.6014141,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01853808127030524,"score_gpt":0.2848250680887153,"score_spread":0.26628698681841,"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."}}