{"id":"W3002304143","doi":"10.1007/s11590-020-01609-9","title":"A perturbation view of level-set methods for convex optimization","year":2020,"lang":"en","type":"preprint","venue":"Optimization Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"Seikei University","keywords":"Parameterized complexity; Duality (order theory); Mathematics; Mathematical optimization; Set (abstract data type); Regular polygon; Convex set; Convex optimization; Constraint (computer-aided design); Limiting; Perturbation (astronomy); Feasible region; Computer science; Combinatorics; Physics; Engineering; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001719701,0.0002897093,0.0004484061,0.0001649401,0.00004087983,0.00006168307,0.0002265774,0.0002474873,0.00004260284],"category_scores_gemma":[0.0001172883,0.0003338191,0.0001590305,0.0001680788,0.0000383938,0.0000788293,0.0001036027,0.0002089577,8.8971e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000070524,"about_ca_system_score_gemma":0.00003128668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004972651,"about_ca_topic_score_gemma":1.96959e-7,"domain_scores_codex":[0.998805,0.0001029837,0.0004675705,0.0003331174,0.0001298609,0.0001614174],"domain_scores_gemma":[0.9990649,0.0001048758,0.0002257723,0.000353676,0.0001992303,0.00005156335],"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.00001337963,0.000006462269,0.000002139602,0.0002605346,0.00009082727,3.560464e-7,0.0001942838,0.9853398,0.003531866,0.00009218993,0.00731824,0.003149911],"study_design_scores_gemma":[0.0002013557,0.00002123771,0.000003559094,0.0002104649,0.00009393628,0.000001236624,0.000009411776,0.9835129,0.01331881,0.0002307911,0.002093011,0.000303313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005601985,0.0003536829,0.9959652,0.001291558,0.0005684913,0.0008579749,0.00008120889,0.0005462429,0.000279625],"genre_scores_gemma":[0.008362647,0.000481221,0.988614,0.0009321903,0.0001562391,0.0001436877,0.001187104,0.0001051138,0.00001776628],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009786946,"threshold_uncertainty_score":0.9999114,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07606464728142957,"score_gpt":0.3253525987141181,"score_spread":0.2492879514326886,"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."}}