{"id":"W4245023137","doi":"10.1109/tcsi.2009.2028749","title":"Minimax Design of IIR Digital Filters Using Iterative SOCP","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Minimax; Mathematical optimization; Infinite impulse response; Mathematics; Iterative method; Relaxation (psychology); Convergence (economics); Second-order cone programming; Digital filter; Convex optimization; Filter (signal processing); Algorithm; Computer science; Regular polygon","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.001431848,0.001180671,0.001088638,0.0004376693,0.0003518025,0.001053394,0.0008326501,0.00081413,0.001763443],"category_scores_gemma":[0.00199678,0.0005698628,0.0006490299,0.0005100243,0.0007214273,0.0008395063,0.0006427474,0.001134633,0.0004550775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000576231,"about_ca_system_score_gemma":0.001068959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001152693,"about_ca_topic_score_gemma":0.001193405,"domain_scores_codex":[0.9992637,0.0002118655,0.00003640561,0.0001176612,0.0003129814,0.00005737499],"domain_scores_gemma":[0.9992253,0.0004159854,0.0001055336,0.00004745904,0.0001856072,0.00002012609],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009861718,0.00007367034,0.0002557381,0.0002660217,0.00005444698,0.00009978764,0.0001645973,0.8429852,0.01415033,0.03582661,0.00132009,0.104705],"study_design_scores_gemma":[0.00001180783,0.00005125738,0.00002726182,0.000008990738,0.000004559779,0.00002047058,0.000005585166,0.9948925,0.001649509,0.002492947,0.0008295289,0.000005692124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001433311,0.00005546924,0.9976479,0.00002497375,0.000006749608,0.00002132969,0.000006046399,0.00005660995,0.0007475059],"genre_scores_gemma":[0.2814565,0.0004373869,0.7129872,0.0001836304,0.00005652485,0.0003994839,0.000095856,0.0001282903,0.004255116],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001763443,"threshold_uncertainty_score":0.007572472,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04793524047683621,"score_gpt":0.2577023663040665,"score_spread":0.2097671258272302,"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."}}