{"id":"W4406519921","doi":"10.1016/j.compchemeng.2024.108993","title":"Logic-Based Discrete-Steepest Descent: A solution method for process synthesis Generalized Disjunctive Programs","year":2025,"lang":"en","type":"article","venue":"Computers & Chemical Engineering","topic":"Advanced Control Systems Optimization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Davidson School of Chemical Engineering, Purdue University; National Aeronautics and Space Administration","keywords":"Process (computing); Descent (aeronautics); Gradient descent; Mathematical optimization; Method of steepest descent; Computer science; Algorithm; Mathematics; Artificial intelligence; Engineering; Artificial neural network; Programming language","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.0001207096,0.0003127899,0.0004050413,0.0001274044,0.00005015016,0.00005392625,0.0002280602,0.0001516249,0.000001452127],"category_scores_gemma":[0.0001518474,0.0003237094,0.0001508435,0.0003609812,0.00002330103,0.0001399687,0.00003164653,0.0001499635,0.000001048248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002983143,"about_ca_system_score_gemma":0.00002143531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002902818,"about_ca_topic_score_gemma":4.313193e-7,"domain_scores_codex":[0.9987166,0.0000165738,0.0003473529,0.0003566042,0.0001278392,0.0004350297],"domain_scores_gemma":[0.9992553,0.0002836279,0.000046963,0.0002258257,0.0000936923,0.00009460403],"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.0000346571,0.00002457354,0.000008581572,0.0005904271,0.00009108844,9.830133e-7,0.00004020469,0.948902,0.0353079,0.0006260628,0.0000372012,0.01433632],"study_design_scores_gemma":[0.0008090839,0.0000134229,0.000005403695,0.0003661329,0.00006647007,0.000001385281,0.000007461178,0.9387299,0.05921631,0.000146066,0.0003355123,0.000302885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001783225,0.0002626502,0.9953684,0.00009730928,0.0004766304,0.000869182,0.00000896443,0.001082876,0.00005076749],"genre_scores_gemma":[0.5880846,0.000002124075,0.4108441,0.00003210922,0.0001035396,0.00082598,0.00004948447,0.00005274643,0.000005329634],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5863014,"threshold_uncertainty_score":0.9999215,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007956770999085188,"score_gpt":0.2431487627470868,"score_spread":0.2351919917480016,"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."}}