{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005449524,0.00006239022,0.00009983478,0.00001683551,0.0000706423,0.00006716914,0.00023399,0.0000378804,0.000009167503],"category_scores_gemma":[0.0003043933,0.0000524323,0.00004024309,0.0002720658,0.000006514671,0.0001842732,0.00005280937,0.0000293587,0.000009667716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000278129,"about_ca_system_score_gemma":0.00001462752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001488837,"about_ca_topic_score_gemma":4.266398e-7,"domain_scores_codex":[0.9993455,0.00006543026,0.0001211443,0.0002230156,0.00009980435,0.0001451368],"domain_scores_gemma":[0.9994628,0.0001234255,0.00006995922,0.0002227618,0.00007056968,0.00005050647],"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.000004912661,0.00002590628,0.00002454407,0.000008353161,0.000003749898,1.688527e-7,0.0000203223,0.02531614,0.0001174742,0.1627803,0.0008837705,0.8108144],"study_design_scores_gemma":[0.0002254883,0.00009910204,0.0001059402,0.000005199128,0.000003603935,0.000002031079,0.000001243223,0.9220957,0.0003932782,0.03640828,0.04058841,0.00007173343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001080867,0.00002015329,0.9952934,0.001533773,0.0003745997,0.0001317648,0.000001387502,0.0001097394,0.002524379],"genre_scores_gemma":[0.0003169902,0.00000278851,0.9986064,0.0004263399,0.0001376416,0.00002736978,0.000003003805,0.000004369067,0.0004750373],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8967795,"threshold_uncertainty_score":0.2138127,"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."}}