{"id":"W2132896555","doi":"10.1007/978-3-642-30850-5_8","title":"Compact Relaxations for Polynomial Programming Problems","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Linearization; Relaxation (psychology); Extension (predicate logic); Mathematical optimization; Computer science; Quadratic programming; Constraint programming; Integer programming; Constraint (computer-aided design); Polynomial; Regular polygon; Constraint satisfaction; Linear programming; Class (philosophy); Linear inequality; Quadratic equation; Convex optimization; Mathematics; Stochastic programming; Inequality; Nonlinear system; Programming language; Artificial intelligence","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007417373,0.0003518634,0.0004235521,0.0005640758,0.000320318,0.0001988888,0.0008012819,0.0002640297,0.00005831487],"category_scores_gemma":[0.0006378214,0.00031883,0.0001196577,0.0003332286,0.0005529561,0.0003353119,0.0002383054,0.0006215578,0.00001781564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004115904,"about_ca_system_score_gemma":0.0003646522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005341906,"about_ca_topic_score_gemma":0.00003897044,"domain_scores_codex":[0.9974082,0.00001993446,0.0004770455,0.0006631651,0.0007089127,0.0007227093],"domain_scores_gemma":[0.9972332,0.001247714,0.0003300098,0.0006149035,0.0003913788,0.0001828604],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001644466,0.0001054042,0.00003756496,0.0002470125,0.00002705299,0.000004175573,0.001145328,0.08987256,0.00004942845,0.01798467,0.0002083043,0.8903021],"study_design_scores_gemma":[0.0009086241,0.0002777023,0.00001411586,0.0006473846,0.00003810237,0.00004825286,7.711235e-7,0.5408062,0.0006124621,0.4196957,0.03590421,0.001046529],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000006226931,0.0002166619,0.9958069,0.0004128662,0.0005136362,0.001691022,0.00001942124,0.0001302853,0.00120297],"genre_scores_gemma":[0.003600881,0.00002209968,0.9938355,0.00009764468,0.0007178791,0.00004950072,0.00002272569,0.00008252639,0.001571256],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8892555,"threshold_uncertainty_score":0.9999264,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06770075026149787,"score_gpt":0.3496963925889923,"score_spread":0.2819956423274944,"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."}}