{"id":"W2101538582","doi":"10.1007/s10107-016-1043-1","title":"Convergence analysis for Lasserre’s measure-based hierarchy of upper bounds for polynomial optimization","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Lipschitz continuity; Simplex; Ball (mathematics); Hypercube; Rate of convergence; Lebesgue measure; Infimum and supremum; Polynomial; Measure (data warehouse); Degree (music); Discrete mathematics; Lebesgue integration; Mathematical analysis","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.001154445,0.0002322518,0.0006147586,0.0003685082,0.0001595313,0.00005797949,0.0003118885,0.0001481455,0.0002770484],"category_scores_gemma":[0.005407899,0.0001670688,0.0004578248,0.0007323627,0.0002288407,0.0001957252,0.00005103791,0.00007436932,0.000005065586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000123962,"about_ca_system_score_gemma":0.0001294758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001196884,"about_ca_topic_score_gemma":0.000002740691,"domain_scores_codex":[0.9976425,0.00007723372,0.0007878725,0.0004026136,0.0005404647,0.0005493679],"domain_scores_gemma":[0.9952776,0.00301588,0.0003130047,0.0004607068,0.000764641,0.0001681247],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004307924,0.007055981,0.00376841,0.0109393,0.006324981,0.000007054156,0.002152366,0.1254265,0.006709078,0.5121109,0.002687492,0.31851],"study_design_scores_gemma":[0.00278762,0.0003675763,0.00001007344,0.0001990315,0.0006142347,0.000001376343,0.0001023701,0.9209608,0.008422837,0.06467246,0.001446894,0.0004147116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006667441,0.00002264767,0.996555,0.0005081056,0.00005445806,0.001912157,0.00005601032,0.0001290717,0.00009584439],"genre_scores_gemma":[0.08167061,0.00000288672,0.916775,0.00001965169,0.00006159542,0.0008888295,0.00002562741,0.0000650741,0.0004906725],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7955344,"threshold_uncertainty_score":0.6812869,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07414095966189453,"score_gpt":0.3718518006673586,"score_spread":0.297710841005464,"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."}}