{"id":"W2043567166","doi":"10.1109/icassp.2014.6855084","title":"Generalized quadratically constrained quadratic programming for signal processing","year":2014,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Quadratic growth; Quadratically constrained quadratic program; Quadratic programming; Karush–Kuhn–Tucker conditions; Second-order cone programming; Generalization; Mathematical optimization; Mathematics; Polynomial; Convex optimization; Computer science; Regular polygon; 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.001187403,0.001325368,0.0009109826,0.0004387416,0.0003337662,0.0007502722,0.0009685589,0.001122425,0.002793607],"category_scores_gemma":[0.002585231,0.0003556029,0.0007346901,0.001135884,0.001003944,0.0009606682,0.001049393,0.00272035,0.0008728065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007247829,"about_ca_system_score_gemma":0.00110198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002280845,"about_ca_topic_score_gemma":0.001929385,"domain_scores_codex":[0.999183,0.0003534126,0.00002728716,0.0001388236,0.0002373137,0.00006025645],"domain_scores_gemma":[0.9991861,0.0005202766,0.00005183688,0.00006354496,0.0001541317,0.00002410101],"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.00005827416,0.00005774093,0.0001670098,0.0004263284,0.00005872825,0.0001079,0.00008906578,0.7023894,0.003659263,0.1899947,0.007064589,0.09592712],"study_design_scores_gemma":[0.000007120015,0.00002662656,0.0000390773,0.00001128724,0.000005318662,0.00002466738,0.000008036081,0.9586399,0.0004021721,0.03740925,0.003420905,0.000005615886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008704849,0.0003551173,0.9969592,0.000160746,0.00004465609,0.00001427179,0.00002532965,0.00004786647,0.001522452],"genre_scores_gemma":[0.197427,0.003223453,0.7872846,0.0004629641,0.0005525048,0.0003312863,0.000452744,0.0002467008,0.0100187],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002793607,"threshold_uncertainty_score":0.009345531,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01778530577757805,"score_gpt":0.2488891485896755,"score_spread":0.2311038428120975,"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."}}