{"id":"W2098204196","doi":"10.1080/10556788.2014.936438","title":"Penalty decomposition methods for rank minimization","year":2014,"lang":"en","type":"preprint","venue":"Optimization methods & software","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rank (graph theory); Minification; Mathematical optimization; Penalty method; Mathematics; Low-rank approximation; Matrix (chemical analysis); Sequence (biology); Algorithm; Computer science; Combinatorics; Hankel matrix","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.00131417,0.0005662245,0.000771329,0.0003416247,0.000188491,0.0002145062,0.0004076559,0.0007596329,0.0001065211],"category_scores_gemma":[0.0008537099,0.0006345143,0.0003419416,0.0002368807,0.00004897196,0.0001463719,0.0002184369,0.0004796984,0.000003489459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001657584,"about_ca_system_score_gemma":0.00005930028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006916818,"about_ca_topic_score_gemma":7.707638e-7,"domain_scores_codex":[0.9971055,0.0009648149,0.0007189937,0.0006623805,0.0001710913,0.0003771977],"domain_scores_gemma":[0.9970335,0.001131601,0.0003198041,0.0008244444,0.0005638808,0.0001267189],"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.00002178785,0.00001629278,0.000007430539,0.0002299102,0.00008781582,3.563497e-7,0.00008522924,0.8555194,0.0005204073,0.00006038181,0.004025195,0.1394258],"study_design_scores_gemma":[0.0003243251,0.00003439874,0.00001579512,0.0002918908,0.000235675,0.000006124566,0.000007074763,0.9556706,0.02487843,0.007884298,0.01000363,0.0006477725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003195244,0.001063108,0.9925906,0.0000625619,0.001438273,0.001217777,0.00004955072,0.003121834,0.0004243518],"genre_scores_gemma":[0.0003623054,0.0005149355,0.9962417,0.0001746499,0.0003737672,0.0004422501,0.001565383,0.0002330098,0.00009202774],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.138778,"threshold_uncertainty_score":0.9996106,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03348095355379413,"score_gpt":0.3955012384163833,"score_spread":0.3620202848625892,"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."}}