{"id":"W2253497723","doi":"10.1007/s10107-018-1351-8","title":"Level-set methods for convex optimization","year":2018,"lang":"en","type":"preprint","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"Air Force Office of Scientific Research; Office of Naval Research; U.S. Air Force; Directorate for Mathematical and Physical Sciences; Washington Research Foundation; National Science Foundation","keywords":"Mathematical optimization; Optimization problem; Inference; Set (abstract data type); Convex optimization; Rank (graph theory); Sequence (biology); Computer science; Range (aeronautics); Parametric statistics; Feasible region; Convex function; Regular polygon; Conic optimization; Constraint (computer-aided design); Mathematics; Convex set; Artificial intelligence","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.0005260854,0.000318163,0.0004800642,0.00009619151,0.00006670708,0.0001801171,0.0002889885,0.0003845503,0.0000534229],"category_scores_gemma":[0.000267089,0.0003090754,0.000182636,0.00007554966,0.00008601499,0.00003181873,0.0002569583,0.0002969294,0.00001431438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005482205,"about_ca_system_score_gemma":0.00001973971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001385131,"about_ca_topic_score_gemma":2.720413e-7,"domain_scores_codex":[0.9987389,0.00005163708,0.0004154412,0.0003202192,0.0001268116,0.0003469645],"domain_scores_gemma":[0.9989502,0.0002187283,0.00008695023,0.0005118669,0.000149428,0.00008284178],"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.00004044169,0.0002167004,0.000007628681,0.005923083,0.0008192243,0.000008360254,0.001670391,0.162196,0.001043813,0.01100646,0.01950649,0.7975614],"study_design_scores_gemma":[0.0001013843,0.00004287387,5.693756e-7,0.0004727258,0.00009087275,0.000006653637,0.00002244353,0.9005588,0.009324994,0.07821047,0.0107991,0.0003691512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000220094,0.000227947,0.9947091,0.000035248,0.0003912686,0.001177917,0.00001257815,0.001609558,0.001616333],"genre_scores_gemma":[0.01302761,0.00001509586,0.9859182,0.00002561382,0.0002925254,0.0004528012,0.00008568601,0.0001182674,0.00006420412],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7971922,"threshold_uncertainty_score":0.9999362,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1190633270838573,"score_gpt":0.3848609881634698,"score_spread":0.2657976610796124,"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."}}