{"id":"W1976996892","doi":"10.1007/s10288-014-0269-0","title":"A reliable affine relaxation method for global optimization","year":2014,"lang":"en","type":"article","venue":"4OR","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Interval (graph theory); Affine transformation; Interval arithmetic; Relaxation (psychology); Constraint (computer-aided design); Computation; Operator (biology); Mathematics; Mathematical optimization; Branch and bound; Affine arithmetic; Upper and lower bounds; Global optimization; Algorithm; Local consistency; Linear inequality; Linear programming relaxation; Linear programming; Inequality; Constraint satisfaction; Statistics; Combinatorics","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.001620269,0.00131844,0.001250567,0.0009926845,0.0006606782,0.001205862,0.001645406,0.001709621,0.008823407],"category_scores_gemma":[0.005107614,0.0007904841,0.001157272,0.001061956,0.001099147,0.001542101,0.002122767,0.003766106,0.002710896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005411113,"about_ca_system_score_gemma":0.001175034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002498543,"about_ca_topic_score_gemma":0.00313767,"domain_scores_codex":[0.9990816,0.0003203213,0.00003836811,0.0001156299,0.0003947131,0.00004933064],"domain_scores_gemma":[0.9987166,0.0005152898,0.00009436253,0.000264901,0.0003498805,0.00005896896],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001910003,0.0000819739,0.0002602054,0.0004140666,0.0001171088,0.0001313066,0.0001692173,0.5386562,0.009509152,0.2134437,0.01416085,0.2228651],"study_design_scores_gemma":[0.00001441411,0.00003218682,0.00004853321,0.00002409969,0.00001536477,0.00002869232,0.00000976601,0.9711879,0.001341338,0.0201236,0.0071594,0.00001459678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007413079,0.0001577831,0.9962749,0.00009149744,0.00008761384,0.00001703803,0.0000491024,0.0002105609,0.002370247],"genre_scores_gemma":[0.06753274,0.0005211533,0.919757,0.0002111517,0.0002294944,0.0002048752,0.0002798816,0.001037003,0.01022667],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008823407,"threshold_uncertainty_score":0.02951717,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01547858183578562,"score_gpt":0.3128095133241821,"score_spread":0.2973309314883965,"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."}}