{"id":"W2030072108","doi":"10.4153/cmb-2003-054-7","title":"Optimization of Polynomial Functions","year":2003,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":63,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Semidefinite programming; Polynomial; Set (abstract data type); Duality (order theory); Stability (learning theory); Duality gap; Mathematical optimization; Algebra over a field; Optimization problem; Discrete mathematics; Pure mathematics; Computer science; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004091169,0.0001446303,0.000262567,0.0002488264,0.0001250237,0.00002550173,0.0001598691,0.0001182312,0.05314523],"category_scores_gemma":[0.004093951,0.0001431653,0.00007932732,0.0003370098,0.0001338462,0.0000403243,0.00001629999,0.0001653017,0.001704424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000166113,"about_ca_system_score_gemma":0.0003181603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008626017,"about_ca_topic_score_gemma":0.0001359059,"domain_scores_codex":[0.9985875,0.0001110009,0.0004229047,0.000206552,0.0002739646,0.0003980302],"domain_scores_gemma":[0.9984038,0.0004544831,0.00009376447,0.0003665582,0.0002161517,0.0004651735],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003476635,0.0005776481,0.0001036296,0.0005630668,0.0001630697,0.00004806684,0.0008485548,0.0661919,0.00009646229,0.5151935,0.4143266,0.001852706],"study_design_scores_gemma":[0.004346679,0.000400002,0.00003503649,0.0004153746,0.0002349079,0.0002779978,0.003000484,0.1163399,0.003379284,0.1990615,0.6704652,0.002043633],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001159165,0.00003171874,0.8685191,0.001209359,0.00009422477,0.0004695542,0.00003806517,0.00006688303,0.1284119],"genre_scores_gemma":[0.07443989,0.00001107572,0.8996361,0.0002192066,0.00006686436,0.00007824474,0.00002056234,0.00009738538,0.02543061],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.316132,"threshold_uncertainty_score":0.9990728,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03292077975358874,"score_gpt":0.2937928326217608,"score_spread":0.2608720528681721,"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."}}