{"id":"W2239439492","doi":"10.1007/s11590-016-1023-7","title":"On the convergence rate of grid search for polynomial optimization over the simplex","year":2016,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Simplex; Mathematics; Polynomial; Grid; Convergence (economics); Minification; Computational intelligence; Simplex algorithm; Rate of convergence; Combinatorics; Mathematical optimization; Applied mathematics; Linear programming; Mathematical analysis; Geometry; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01685531,0.001443379,0.002141742,0.002167169,0.001217601,0.002238818,0.002637144,0.002054859,0.006780728],"category_scores_gemma":[0.1124763,0.0007346019,0.001308494,0.002309583,0.004321899,0.00457665,0.004388747,0.005203626,0.001189674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001766366,"about_ca_system_score_gemma":0.002545691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006687081,"about_ca_topic_score_gemma":0.004055249,"domain_scores_codex":[0.9934742,0.00403697,0.0002221172,0.0004763075,0.001173351,0.0006172034],"domain_scores_gemma":[0.9004463,0.08822175,0.001631127,0.004375123,0.004196539,0.001129108],"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.001897303,0.0001673527,0.005461625,0.0006869177,0.0001842228,0.0001858551,0.0004501481,0.6186938,0.002998773,0.2844934,0.01055729,0.07422327],"study_design_scores_gemma":[0.00005584204,0.00007871408,0.0003822726,0.00008977308,0.00002375648,0.00004999398,0.00006068039,0.948267,0.0008135525,0.04916079,0.001001318,0.00001640479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07996948,0.006368462,0.8782924,0.003225729,0.0005926723,0.0002097407,0.0004054756,0.0009014768,0.03003443],"genre_scores_gemma":[0.7627598,0.003600207,0.2201892,0.000970509,0.000340049,0.0005650432,0.0007000698,0.00158762,0.009287437],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01685531,"threshold_uncertainty_score":0.08914047,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04872328661789242,"score_gpt":0.333099539714014,"score_spread":0.2843762530961215,"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."}}