{"id":"W2963292690","doi":"10.1007/s10107-013-0714-4","title":"Iterative hard thresholding methods for $$l_0$$ l 0 regularized convex cone programming","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":96,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Regular polygon; Convex optimization; Relaxation (psychology); Mathematical optimization; Quadratic programming; Sequence (biology); Convex cone; Cone (formal languages); Thresholding; Iterative method; Limit point; Interior point method; Applied mathematics; Algorithm; Convex analysis; Computer science; Mathematical analysis; Geometry; Image (mathematics); 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.000588803,0.0003606024,0.0006114008,0.0001151099,0.0001759593,0.0004849969,0.0002649135,0.0001876228,0.000107249],"category_scores_gemma":[0.0003052104,0.0003169203,0.0002090611,0.00021943,0.0001381989,0.0003031024,0.00008692616,0.0002775122,0.00005643566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006321763,"about_ca_system_score_gemma":0.00001174499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005818174,"about_ca_topic_score_gemma":3.603226e-7,"domain_scores_codex":[0.9981271,0.00007484083,0.0005585021,0.0003568031,0.0001857747,0.0006969985],"domain_scores_gemma":[0.9985779,0.0005447884,0.00008887814,0.0004222436,0.0001926107,0.0001735894],"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.00001554182,0.0001307675,0.00001835657,0.0005191463,0.0002516009,0.000006782554,0.001261965,0.00006991094,0.08173627,0.02834312,0.001613479,0.8860331],"study_design_scores_gemma":[0.001123016,0.0002523575,0.00002185904,0.0008204526,0.0001700168,0.00005833486,0.000649845,0.5695806,0.2082975,0.1654391,0.05246056,0.001126447],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01173553,0.0003195176,0.9816753,0.0001682906,0.0001527591,0.002573166,0.000001500125,0.002133837,0.001240128],"genre_scores_gemma":[0.155694,0.000004678885,0.8425121,0.00006796943,0.0001044667,0.00134528,0.00001115472,0.0000965716,0.000163793],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8849066,"threshold_uncertainty_score":0.9999283,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04073664706120077,"score_gpt":0.3230238328338438,"score_spread":0.282287185772643,"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."}}