{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001083414,0.0008243934,0.001437376,0.0006754629,0.0006190339,0.001080805,0.001316528,0.001385388,0.004046075],"category_scores_gemma":[0.003010276,0.0007409359,0.0009826182,0.001210507,0.0009844857,0.001172731,0.001726922,0.002082568,0.000916652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004140968,"about_ca_system_score_gemma":0.001429332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003167257,"about_ca_topic_score_gemma":0.005007406,"domain_scores_codex":[0.9996099,0.0001333445,0.00002285433,0.0000458608,0.0001594553,0.00002863484],"domain_scores_gemma":[0.9990433,0.0005221842,0.00006499657,0.0001314695,0.0001742453,0.00006373287],"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.0001153419,0.0001119532,0.0003990498,0.0002126519,0.00009029303,0.00009543178,0.0001190586,0.7238091,0.005515556,0.1282799,0.003696166,0.1375555],"study_design_scores_gemma":[0.00000689124,0.00001355114,0.00002600749,0.000004890309,0.000004664644,0.000007584833,0.000003625757,0.9869089,0.000245596,0.01149529,0.001277248,0.000005866406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002556305,0.00006583516,0.9960181,0.00004324188,0.0000389385,0.00001813033,0.00002204543,0.0001609931,0.001076337],"genre_scores_gemma":[0.1126675,0.0002253724,0.8794926,0.00009581935,0.00007636077,0.0002090834,0.0001696482,0.000333067,0.006730617],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004046075,"threshold_uncertainty_score":0.0135355,"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."}}