{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002757984,0.002714313,0.002250163,0.001833647,0.0007311472,0.003460446,0.002207214,0.003014011,0.008307155],"category_scores_gemma":[0.01419878,0.00119031,0.00137603,0.002504357,0.002937008,0.00350994,0.003698459,0.008664736,0.002980133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001562975,"about_ca_system_score_gemma":0.001490206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002398016,"about_ca_topic_score_gemma":0.00271937,"domain_scores_codex":[0.9985831,0.0007113773,0.00006567554,0.0001545833,0.0004357016,0.0000496078],"domain_scores_gemma":[0.9954023,0.003347919,0.000228459,0.0003901307,0.0004860439,0.0001451677],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000391803,0.00006641191,0.0001602454,0.0004659893,0.0000970362,0.00006662831,0.0001126061,0.08547754,0.001179907,0.8376333,0.01703134,0.05766989],"study_design_scores_gemma":[0.00001649243,0.00001129676,0.0000541193,0.00005903619,0.00001696709,0.00002970489,0.00001786928,0.4457779,0.0004104722,0.5444534,0.009138705,0.00001405135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006868956,0.001370974,0.9920249,0.0008196151,0.0001732001,0.00002382549,0.0001216579,0.0001612269,0.004617688],"genre_scores_gemma":[0.08369111,0.005904313,0.8847181,0.000793155,0.001194679,0.0006359789,0.0006964881,0.001370152,0.02099608],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008307155,"threshold_uncertainty_score":0.02779019,"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."}}