Results 11 to 20 of about 72,594 (306)
Approximation in stochastic integer programming
Approximation algorithms are the prevalent solution methods in the field of stochastic programming. Problems in this field are very hard to solve. Indeed, most of the research in this field has concentrated on designing solution methods that approximate the optimal solutions.
Stougie, Leen, Vlerk, Maarten H. van der
openaire +9 more sources
Efficiency of the stochastic approximation method [PDF]
The practical aspect of the stochastic approximation method (SA) is studied. Specifically, we investigated the efficiency depending on the coefficients that generate the step length in optimization algorithm, as well as the efficiency depending on the
Japundžić Miloš
doaj +1 more source
A Continuous Dynamic Stochastic Approximation Procedure [PDF]
This paper considers the continuous Kiefer-Nolfowitz stochastic approximation procedure, where the regression function changes with time t. Let ED(t) be the unique minimum (maximum) of the regression function at a time t.
El Sayed Sorour
doaj +1 more source
Pathwise Convergent Approximation for the Fractional SDEs
Fractional stochastic differential equation (FSDE)-based random processes are used in a wide spectrum of scientific disciplines. However, in the majority of cases, explicit solutions for these FSDEs do not exist and approximation schemes have to be ...
Kęstutis Kubilius, Aidas Medžiūnas
doaj +1 more source
Stochastic approximation versus sample average approximation for Wasserstein barycenters
In the machine learning and optimization community, there are two main approaches for the convex risk minimization problem, namely the Stochastic Approximation (SA) and the Sample Average Approximation (SAA).
Dvinskikh, Darina
core +1 more source
Stochastic Entropy Solutions for Stochastic Scalar Balance Laws
We are concerned with the initial value problem for a multidimensional balance law with multiplicative stochastic perturbations of Brownian type.
Jinlong Wei +3 more
doaj +1 more source
Best Response Computation in Multiplayer Imperfect-Information Stochastic Games
Computing a best response is a fundamental task in game theory. One of its uses is to compute the degree of approximation error of an approximation of Nash equilibrium strategies.
Sam Ganzfried
doaj +1 more source
Stochastic Approximations and Differential Inclusions [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michel Benaïm +2 more
openaire +3 more sources
Asymptotic Analysis for One-Stage Stochastic Linear Complementarity Problems and Applications
One-stage stochastic linear complementarity problem (SLCP) is a special case of a multi-stage stochastic linear complementarity problem, which has important applications in economic engineering and operations management.
Shuang Lin, Jie Zhang, Chen Qiu
doaj +1 more source
Submodular stochastic probing on matroids [PDF]
In a stochastic probing problem we are given a universe E, where each element e in E is active independently with probability p in [0,1], and only a probe of e can tell us whether it is active or not. On this universe we execute a process that one by one
Sviridenko, Maxim +5 more
core +1 more source

