{"id":"W2547457306","doi":"10.1109/ccece.2016.7726815","title":"Penalty convex-concave procedure for source localization problem","year":2016,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematical optimization; Regular polygon; Focus (optics); Convex optimization; Norm (philosophy); Computer science; Convex function; Residual; Path (computing); Mathematics; Algorithm","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.001335912,0.001427115,0.0007719013,0.0005363566,0.0004372148,0.0007421365,0.0009873892,0.001245091,0.003304661],"category_scores_gemma":[0.002944313,0.0003870418,0.0006901543,0.0007296086,0.001028021,0.0009022515,0.001431818,0.002069094,0.001270036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006189602,"about_ca_system_score_gemma":0.001191194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00187612,"about_ca_topic_score_gemma":0.001705078,"domain_scores_codex":[0.9994094,0.000278889,0.00001896621,0.00009692705,0.0001493346,0.0000465841],"domain_scores_gemma":[0.9991208,0.0005722761,0.00006417189,0.00006157317,0.0001414388,0.00003973874],"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.0001759671,0.00006338182,0.0004867517,0.0004436657,0.00005361737,0.000368852,0.0001670589,0.7840836,0.01271909,0.09991784,0.00866352,0.09285668],"study_design_scores_gemma":[0.000007886141,0.0000270825,0.00004280849,0.000009554161,0.000004091206,0.00006959518,0.0000117622,0.9883298,0.001669101,0.00802295,0.001797592,0.000007759866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001009635,0.00007770041,0.9978531,0.0001429443,0.0000173692,0.00001606891,0.00001969959,0.00008250085,0.0007808401],"genre_scores_gemma":[0.1835819,0.0008017806,0.8038881,0.0004185899,0.0001818115,0.0004623705,0.0003650158,0.0004089197,0.009891452],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003304661,"threshold_uncertainty_score":0.01105517,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01099519778969767,"score_gpt":0.2139833127232169,"score_spread":0.2029881149335192,"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."}}