{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003192274,0.001722784,0.001456516,0.00100328,0.0005921718,0.002496455,0.002509252,0.00204849,0.005797528],"category_scores_gemma":[0.01351622,0.001025335,0.001241262,0.001295184,0.002586376,0.00239052,0.003099614,0.005043057,0.001231096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001430198,"about_ca_system_score_gemma":0.002445495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003701512,"about_ca_topic_score_gemma":0.003783921,"domain_scores_codex":[0.9985337,0.0007209682,0.00006102703,0.0001989404,0.0003921238,0.00009324591],"domain_scores_gemma":[0.9952691,0.003399751,0.000239036,0.0002321368,0.0006990158,0.0001607986],"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.0000763504,0.0001293531,0.0002515589,0.0003846152,0.00006728627,0.0001074613,0.0001972864,0.4184717,0.002639299,0.4753771,0.01010127,0.09219667],"study_design_scores_gemma":[0.000007080496,0.00001362476,0.00002808127,0.00001824391,0.000005027791,0.000013158,0.00001355263,0.943028,0.0003760839,0.05508315,0.001404847,0.000009225158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001024027,0.0001523704,0.9961748,0.0002063242,0.00005313732,0.0000267182,0.0000318205,0.0000644773,0.00226635],"genre_scores_gemma":[0.1136646,0.0008745695,0.8681259,0.0004497761,0.0003402002,0.0005313003,0.0003295559,0.0005333551,0.01515074],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005797528,"threshold_uncertainty_score":0.0193947,"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."}}