Results 211 to 220 of about 142,307 (303)

Trust‐region filter algorithms utilizing Hessian information for gray‐box optimization

open access: yesAIChE Journal, EarlyView.
Abstract Optimizing industrial processes often involves gray‐box models that couple algebraic glass‐box equations with black‐box components lacking analytic derivatives. Such systems challenge derivative‐based solvers. The classical trust‐region filter (TRF) algorithm provides a robust framework but requires extensive parameter tuning and numerous ...
Gul Hameed   +4 more
wiley   +1 more source

A trust‐region funnel algorithm for gray‐box optimization

open access: yesAIChE Journal, EarlyView.
Abstract Gray‐box optimization, where parts of optimization problems are represented by algebraic models while others are treated as black‐box models lacking analytic derivatives, remains a challenge. Trust‐region (TR) methods provide a robust framework for gray‐box problems through local reduced models (RMs) for black‐box components, but they are ...
Gul Hameed   +4 more
wiley   +1 more source

Monitoring and control of a continuous, integrated filtration‐drying system with in‐line mass spectrometry via PharmaPy

open access: yesAIChE Journal, EarlyView.
Abstract This article demonstrates the integration of in‐line mass spectrometry as a process analytical technology (PAT) tool with model‐based soft sensors in a continuous filtration‐drying carousel system for solid–liquid separation (SLS) of crystal slurries.
Inyoung Hur   +3 more
wiley   +1 more source

Sequential Monte Carlo with likelihood tempering and parallel implementation for uncertainty quantification

open access: yesAIChE Journal, EarlyView.
Abstract Bayesian estimation enables uncertainty quantification, but analytical implementation is often intractable. As an approximate approach, the Markov Chain Monte Carlo (MCMC) method is widely used, though it entails a high computational cost due to frequent evaluations of the likelihood function.
Tatsuki Maruchi   +2 more
wiley   +1 more source

Graph‐based imitation and reinforcement learning for efficient Benders decomposition

open access: yesAIChE Journal, EarlyView.
Abstract This work introduces an end‐to‐end graph‐based agent for accelerating the computational efficiency of Benders Decomposition. The agent's policy is parameterized by a graph neural network, which takes as input a bipartite graph representation of the master problem and proposes a candidate solution.
Bernard T. Agyeman   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy