modeling of fermentation processes is so complicated and uncertain; therefore it is necessary to provide a robust and appropriate dynamic optimization method. in order to obtain the maximum amount of yeast (saccharomyces cerevisiae), the bioreactor must be operated under optimal conditions. to determine substrate feeding in a fed-batch bioreactor, a simulated annealing (sa) approach was examine...

This paper investigates a variational approach to the nonlinear stochastic inverse problem of probabilistically calibrating the Robin coefficient from boundary measurements for the steady-state heat conduction. The problem is formulated into an optimization problem, and mathematical properties relevant to its numerical computations are investigated. The spectral stochastic finite element method...

Determination of optimum location for drilling a new well not only requires engineering judgments but also consumes excessive computational time. Additionally, availability of many physical constraints such as the well length, trajectory, and completion type and the numerous affecting parameters including, well type, well numbers, well-control variables prompt that the optimization approaches b...

Stochastic gradient optimization is a class of widely used algorithms for training machine learning models. To optimize an objective, it uses the noisy gradient computed from the random data samples instead of the true gradient computed from the entire dataset. However, when the variance of the noisy gradient is large, the algorithm might spend much time bouncing around, leading to slower conve...

In this paper, a stochastic connectionist approach is proposed for solving function optimization problems with real-valued parameters. With the assumption of increased processing capability of a node in the connectionist network, we show how a broader class of problems can be solved. As the proposed approach is a stochastic search technique, it avoids getting stuck in local optima. Robustness o...

Stochastic gradient Markov chain Monte Carlo (SG-MCMC) methods are Bayesian analogs to popular stochastic optimization methods; however, this connection is not well studied. We explore this relationship by applying simulated annealing to an SGMCMC algorithm. Furthermore, we extend recent SG-MCMC methods with two key components: i) adaptive preconditioners (as in ADAgrad or RMSprop), and ii) ada...

In wireless sensor networks (WSNs), there generally exist many different objective functions to be optimized. In this paper, we propose a stochastic multiobjective optimization approach to solve such kind of problem. We first formulate a general multiobjective optimization problem. We then decompose the optimization formulation through Lagrange dual decomposition and adopt the stochastic quasig...

in this work an improved method for designing a linear vibrational absorber, excited by random vibrations is presented and analyzed. first, analytical expressions, for non-stationary white noise accelerations, are derived. the criterion is different from the conventional criteria, used for structural design under random vibration, and it is based on minimum displacement or acceleration response...