• Title/Summary/Keyword: Stochastic Approximation

Search Result 138, Processing Time 0.022 seconds

SOME STABILITY RESULTS FOR SEMILINEAR STOCHASTIC HEAT EQUATION DRIVEN BY A FRACTIONAL NOISE

  • El Barrimi, Oussama;Ouknine, Youssef
    • Bulletin of the Korean Mathematical Society
    • /
    • v.56 no.3
    • /
    • pp.631-648
    • /
    • 2019
  • In this paper, we consider a semilinear stochastic heat equation driven by an additive fractional white noise. Under the pathwise uniqueness property, we establish various strong stability results. As a consequence, we give an application to the convergence of the Picard successive approximation.

Sample Average Approximation Method for Task Assignment with Uncertainty (불확실성을 갖는 작업 할당 문제를 위한 표본 평균 근사법)

  • Gwang, Kim
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.28 no.1
    • /
    • pp.27-34
    • /
    • 2023
  • The optimal assignment problem between agents and tasks is known as one of the representative problems of combinatorial optimization and an NP-hard problem. This paper covers multi agent-multi task assignment problems with uncertain completion probability. The completion probabilities are generally uncertain due to endogenous (agent or task) or exogenous factors in the system. Assignment decisions without considering uncertainty can be ineffective in a real situation that has volatility. To consider uncertain completion probability mathematically, a mathematical formulation with stochastic programming is illustrated. We also present an algorithm by using the sample average approximation method to solve the problem efficiently. The algorithm can obtain an assignment decision and the upper and lower bounds of the assignment problem. Through numerical experiments, we present the optimality gap and the variance of the gap to confirm the performances of the results. This shows the excellence and robustness of the assignment decisions obtained by the algorithm in the problem with uncertainty.

Tolerance Optimization with Markov Chain Process (마르코프 과정을 이용한 공차 최적화)

  • Lee, Jin-Koo
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.13 no.2
    • /
    • pp.81-87
    • /
    • 2004
  • This paper deals with a new approach to tolerance optimization problems. Optimal tolerance allotment problems can be formulated as stochastic optimization problems. Most schemes to solve the stochastic optimization problems have been found to exhibit difficulties in multivariate integration of the probability density function. As a typical example of stochastic optimization the optimal tolerance allotment problem has the same difficulties. In this stochastic model, manufacturing system is represented by Gauss-Markov stochastic process and the manufacturing unit availability is characterized for realistic optimization modeling. The new algorithm performed robustly for a large deviation approximation. A significant reduction in computation time was observed compared to the results obtained in previous studies.

WEAKLY STOCHASTIC RUNGE-KUTTA METHOD WITH ORDER 2

  • Soheili, Ali R.;Kazemi, Zahra
    • Journal of applied mathematics & informatics
    • /
    • v.26 no.1_2
    • /
    • pp.135-149
    • /
    • 2008
  • Many deterministic systems are described by Ordinary differential equations and can often be improved by including stochastic effects, but numerical methods for solving stochastic differential equations(SDEs) are required, and work in this area is far less advanced than for deterministic differential equations. In this paper,first we follow [7] to describe Runge-Kutta methods with order 2 from Taylor approximations in the weak sense and present two well known Runge-Kutta methods, RK2-TO and RK2-PL. Then we obtain a new 3-stage explicit Runge-Kutta with order 2 in weak sense and compare the numerical results among these three methods.

  • PDF

Identification of 18 flutter derivatives by covariance driven stochastic subspace method

  • Mishra, Shambhu Sharan;Kumar, Krishen;Krishna, Prem
    • Wind and Structures
    • /
    • v.9 no.2
    • /
    • pp.159-178
    • /
    • 2006
  • For the slender and flexible cable supported bridges, identification of all the flutter derivatives for the vertical, lateral and torsional motions is essential for its stability investigation. In all, eighteen flutter derivatives may have to be considered, the identification of which using a three degree-of-freedom elastic suspension system has been a challenging task. In this paper, a system identification technique, known as covariance-driven stochastic subspace identification (COV-SSI) technique, has been utilized to extract the flutter derivatives for a typical bridge deck. This method identifies the stochastic state-space model from the covariances of the output-only (stochastic) data. All the eighteen flutter derivatives have been simultaneously extracted from the output response data obtained from wind tunnel test on a 3-DOF elastically suspended bridge deck section-model. Simplicity in model suspension and measurements of only output responses are additional motivating factors for adopting COV-SSI technique. The identified discrete values of flutter derivatives have been approximated by rational functions.

A survey on parallel training algorithms for deep neural networks (심층 신경망 병렬 학습 방법 연구 동향)

  • Yook, Dongsuk;Lee, Hyowon;Yoo, In-Chul
    • The Journal of the Acoustical Society of Korea
    • /
    • v.39 no.6
    • /
    • pp.505-514
    • /
    • 2020
  • Since a large amount of training data is typically needed to train Deep Neural Networks (DNNs), a parallel training approach is required to train the DNNs. The Stochastic Gradient Descent (SGD) algorithm is one of the most widely used methods to train the DNNs. However, since the SGD is an inherently sequential process, it requires some sort of approximation schemes to parallelize the SGD algorithm. In this paper, we review various efforts on parallelizing the SGD algorithm, and analyze the computational overhead, communication overhead, and the effects of the approximations.

Multiple Change-Point Estimation of Air Pollution Mean Vectors

  • Kim, Jae-Hee;Cheon, Sooy-Oung
    • The Korean Journal of Applied Statistics
    • /
    • v.22 no.4
    • /
    • pp.687-695
    • /
    • 2009
  • The Bayesian multiple change-point estimation has been applied to the daily means of ozone and PM10 data in Seoul for the period 1999. We focus on the detection of multiple change-points in the ozone and PM10 bivariate vectors by evaluating the posterior probabilities and Bayesian information criterion(BIC) using the stochastic approximation Monte Carlo(SAMC) algorithm. The result gives 5 change-points of mean vectors of ozone and PM10, which are related with the seasonal characteristics.

ROBUST PORTFOLIO OPTIMIZATION UNDER HYBRID CEV AND STOCHASTIC VOLATILITY

  • Cao, Jiling;Peng, Beidi;Zhang, Wenjun
    • Journal of the Korean Mathematical Society
    • /
    • v.59 no.6
    • /
    • pp.1153-1170
    • /
    • 2022
  • In this paper, we investigate the portfolio optimization problem under the SVCEV model, which is a hybrid model of constant elasticity of variance (CEV) and stochastic volatility, by taking into account of minimum-entropy robustness. The Hamilton-Jacobi-Bellman (HJB) equation is derived and the first two orders of optimal strategies are obtained by utilizing an asymptotic approximation approach. We also derive the first two orders of practical optimal strategies by knowing that the underlying Ornstein-Uhlenbeck process is not observable. Finally, we conduct numerical experiments and sensitivity analysis on the leading optimal strategy and the first correction term with respect to various values of the model parameters.

Stochastic Programming Approach to Scheduling Elective Surgeries and the Effects of Newsvendor Ratio on Operating Room Utilization (추계적 계획법을 이용한 수술실 예약 모델과 Newsvendor 비율의 자원 효율성에 대한 영향 분석)

  • Min, Dai-Ki
    • Korean Management Science Review
    • /
    • v.28 no.2
    • /
    • pp.17-29
    • /
    • 2011
  • The purpose of this paper is to schedule elective surgery patients using a stochastic programming approach and to illustrate how operating room utilization behaves when a decision-maker varies costs associated with utilization. Because of the uncertainty in surgery durations, the underage and overage costs that a decision-maker considers plays an important role in allocating surgery cases into available operating room capacity. We formulate the problem as a stochastic mixed integer programming and propose a sampling-based approximation method for a computational purpose. Newsvendor model is employed to explain the results from numerical experiments that are conducted with the actual data from a hospital. The results show that the operating room utilization is more sensitive when the unit overtime cost is relatively larger than the unit cost for underutilized time.

SPARSE GRID STOCHASTIC COLLOCATION METHOD FOR STOCHASTIC BURGERS EQUATION

  • Lee, Hyung-Chun;Nam, Yun
    • Journal of the Korean Mathematical Society
    • /
    • v.54 no.1
    • /
    • pp.193-213
    • /
    • 2017
  • We investigate an efficient approximation of solution to stochastic Burgers equation driven by an additive space-time noise. We discuss existence and uniqueness of a solution through the Orstein-Uhlenbeck (OU) process. To approximate the OU process, we introduce the Karhunen-$Lo{\grave{e}}ve$ expansion, and sparse grid stochastic collocation method. About spatial discretization of Burgers equation, two separate finite element approximations are presented: the conventional Galerkin method and Galerkin-conservation method. Numerical experiments are provided to demonstrate the efficacy of schemes mentioned above.