{"id":"W3048704129","doi":"10.3233/jifs-200374","title":"An approximation algorithm for solving standard quadratic optimization problems","year":2020,"lang":"en","type":"article","venue":"Journal of Intelligent & Fuzzy Systems","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Wilfrid Laurier University; Conestoga College","funders":"","keywords":"Semidefinite programming; Algorithm; Computational complexity theory; Mathematics; Linear programming; Approximation algorithm; Heuristic; Mathematical optimization; Quadratic programming; Matrix (chemical analysis); Quadratic equation; Computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.001534897,0.0002372109,0.0006100396,0.0002490459,0.0001620259,0.0002904736,0.0004103109,0.0001280598,0.00004483147],"category_scores_gemma":[0.001182919,0.0002013115,0.0001791539,0.0004243597,0.00004114909,0.0008666981,0.00003337311,0.0003024417,0.000006430268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002954199,"about_ca_system_score_gemma":0.0002101598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000286924,"about_ca_topic_score_gemma":8.894388e-7,"domain_scores_codex":[0.9966779,0.0001872255,0.001563128,0.0002559246,0.0009796837,0.0003361887],"domain_scores_gemma":[0.9956256,0.0004010698,0.00127635,0.0002371529,0.002107436,0.0003524353],"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.000108924,0.0001570968,0.00001608029,0.0007012388,0.0001241553,0.000007777637,0.002466253,0.975719,0.0003518186,0.002296089,0.001079215,0.01697239],"study_design_scores_gemma":[0.0006774366,0.001181725,3.867643e-7,0.0002837441,0.00005375522,0.00005404835,0.002629252,0.9895884,0.001542934,0.002902564,0.0008780056,0.0002077507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002523912,0.0004395238,0.9967688,0.0003584713,0.0004610867,0.001481599,0.0000323202,0.00006971121,0.0001361132],"genre_scores_gemma":[0.01893086,0.0002031387,0.9795238,0.00006357257,0.0009663179,0.00007143703,0.00002876074,0.00009916327,0.0001129112],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01867847,"threshold_uncertainty_score":0.8209245,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08199086183557162,"score_gpt":0.3593272716802328,"score_spread":0.2773364098446612,"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."}}