{"id":"W3176077280","doi":"10.1016/j.compchemeng.2021.107413","title":"Bounding convex relaxations of process models from below by tractable black-box sampling","year":2021,"lang":"en","type":"article","venue":"Computers & Chemical Engineering","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounding overwatch; Mathematical optimization; Black box; Sampling (signal processing); Convex optimization; Process (computing); Regular polygon; Affine transformation; Minimum bounding box; Computation; Global optimization; Computer science; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007551793,0.00347516,0.004545911,0.00136366,0.00108339,0.003611261,0.003232366,0.003623425,0.006912124],"category_scores_gemma":[0.03395874,0.002480203,0.002379303,0.001153184,0.004165111,0.004386041,0.005029666,0.008528313,0.0008059788],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003630311,"about_ca_system_score_gemma":0.004693986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01119716,"about_ca_topic_score_gemma":0.01098333,"domain_scores_codex":[0.9964887,0.002048329,0.00009196433,0.0004541754,0.0004998014,0.0004171786],"domain_scores_gemma":[0.9620892,0.03453199,0.00101474,0.0009883817,0.00066232,0.0007132787],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001367789,0.0001005096,0.000356997,0.0001225998,0.0000425061,0.00006700912,0.00006370864,0.9518942,0.0002766211,0.04084115,0.001411309,0.004686698],"study_design_scores_gemma":[0.00001072749,0.000009049949,0.00001864368,0.000009213846,0.00000399938,0.000003040288,0.000005766158,0.9820562,0.0000544001,0.01770554,0.0001207995,0.000002610179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02023594,0.0006941886,0.9696334,0.001242995,0.00008717487,0.000166321,0.000261167,0.0004486526,0.007230184],"genre_scores_gemma":[0.6438464,0.001324631,0.3359087,0.001246925,0.0003730668,0.001081201,0.001248052,0.0009032485,0.01406778],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01119716,"threshold_uncertainty_score":0.03993815,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03991637493867631,"score_gpt":0.3113688499825047,"score_spread":0.2714524750438284,"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."}}