{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001164206,0.001000773,0.001299554,0.0006658914,0.0005289183,0.001039198,0.0014115,0.001394503,0.004386699],"category_scores_gemma":[0.002391386,0.0007400904,0.0009744509,0.0006302858,0.0008076063,0.0006922939,0.001086887,0.001787688,0.0006907392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009296538,"about_ca_system_score_gemma":0.002097499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006788389,"about_ca_topic_score_gemma":0.007454534,"domain_scores_codex":[0.9995922,0.0001460296,0.00001821757,0.00005788098,0.0001415728,0.00004402101],"domain_scores_gemma":[0.9991494,0.0005549003,0.00003506815,0.00003701029,0.0001904702,0.00003318869],"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.00006276008,0.00005690633,0.0001570735,0.0001193875,0.00004001745,0.0000385823,0.0000399024,0.909418,0.001859536,0.01364471,0.001341146,0.07322189],"study_design_scores_gemma":[0.000006731213,0.000006260481,0.000008953377,0.000002758822,0.000002248477,0.000002510746,0.000001543831,0.9984402,0.0001700405,0.001181892,0.0001755061,0.000001287726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002426465,0.00007628284,0.9958625,0.00005683887,0.00001984611,0.00003322596,0.00001922971,0.0002707463,0.001234807],"genre_scores_gemma":[0.2019002,0.0001894756,0.7928852,0.0002403642,0.0000486538,0.0003071091,0.0001598759,0.0002900555,0.003979006],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006788389,"threshold_uncertainty_score":0.01467496,"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."}}