{"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009686311,0.0002048981,0.0002109518,0.000135489,0.0003301698,0.00005651552,0.0004951764,0.00007739697,0.001584824],"category_scores_gemma":[0.001515973,0.0001052266,0.0001164491,0.0004600729,0.0003189708,0.0002651276,0.00009023164,0.0001301113,0.00001302333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001137667,"about_ca_system_score_gemma":0.00007506653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006438524,"about_ca_topic_score_gemma":0.000001220645,"domain_scores_codex":[0.9980634,0.0003341384,0.0004654901,0.0003275687,0.0004296226,0.0003798093],"domain_scores_gemma":[0.9946975,0.003987058,0.0002701036,0.0006004032,0.000377823,0.00006715567],"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.000133988,0.00004052469,0.00002098918,0.00001918219,0.00003819634,4.247765e-7,0.0001304037,0.9561598,0.0008732291,0.01314725,0.02904768,0.0003882709],"study_design_scores_gemma":[0.001417269,0.00008448915,0.00002534103,0.00005371228,0.00002554726,0.000001535793,0.00007116646,0.989193,0.006723287,0.0009411703,0.001242706,0.0002207475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002657399,0.000005648791,0.9719941,0.02350127,0.0002516075,0.001266409,0.0000994944,0.00005739745,0.0001666893],"genre_scores_gemma":[0.1501822,0.0005061429,0.8277182,0.01518685,0.001261682,0.001135276,0.000207647,0.0004578906,0.003344105],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1475248,"threshold_uncertainty_score":0.9993278,"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."}}