{"id":"W1988815259","doi":"10.1007/s10107-015-0870-9","title":"A dynamic inequality generation scheme for polynomial programming","year":2015,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Polynomial; Scheme (mathematics); Binary number; Relaxation (psychology); Mathematical optimization; Semidefinite programming; Applied mathematics; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.002047434,0.000299445,0.0004738521,0.0001456183,0.0002158298,0.0002518329,0.0003056086,0.000184303,0.00004568017],"category_scores_gemma":[0.006603019,0.0002705208,0.0001627745,0.0004119602,0.0001451072,0.0003295186,0.0001587455,0.0002669878,0.00005645855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003003034,"about_ca_system_score_gemma":0.0001519919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003105236,"about_ca_topic_score_gemma":0.000009938913,"domain_scores_codex":[0.9970967,0.0001227568,0.0008001367,0.0004919155,0.0007249077,0.0007635988],"domain_scores_gemma":[0.9977908,0.0005497335,0.0002286689,0.0005009833,0.0005282444,0.000401545],"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.0003272126,0.003397336,0.0001540032,0.00265336,0.0003023066,0.0000311683,0.005639282,0.0005891834,0.001798542,0.1869972,0.005401242,0.7927092],"study_design_scores_gemma":[0.002431039,0.0003783664,0.00000178875,0.00009615847,0.00006076029,0.00003432129,0.001012686,0.8462858,0.0007055232,0.1313047,0.0170646,0.0006243499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01220433,0.00005755514,0.9838006,0.0004816576,0.0001255617,0.002515216,0.000008628786,0.000474087,0.0003322974],"genre_scores_gemma":[0.03216016,0.000001252398,0.965564,0.00003660802,0.0002159062,0.001076827,0.00006190617,0.00009738946,0.0007859138],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8456966,"threshold_uncertainty_score":0.9999747,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1996732650202643,"score_gpt":0.4336498546134742,"score_spread":0.2339765895932099,"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."}}