具有位数3和4的双随机循环矩阵中的素元

本文研究了双随机循环矩阵中素元的分类问题．由于任一n阶双随机循环矩阵都可以唯一地表示为移位的n-1次一元多项式,从而可把双随机循环矩阵中素元的分类问题简化为解双随机循环矩阵上的一个方程．应用此原理,本文完全解决了判别具有位数3的n阶双随机循环矩阵是否为素元的问题,并给出了n阶双随机循环矩阵中一类具有位数4的素元．     

Stochastic realization of a Gaussian stochastic control system

The stochastic realization problem is considered of representing a stationary Gaussian process as the observation process of a Gaussian stochastic control system. The problem formulation includes that the lastm components of the observation process form the Gaussian white noise input process to the system. Identifiability of this class of systems motivates the problem. The results include a necessary and sufficient condition for the existence of a stochastic realization. A subclass of Gaussian stochastic control systems is defined that is almost a canonical form for this stochastic realization problem. For a structured Gaussian stochastic control system an equivalent condition for identifiability of the parametrization is stated.The research of this paper is supported in part by the Commission of the European Communities through the SCIENCE Program by the projectSystem Identification with contract number SC1-CT92-0779.     

Two-Stage Stochastic Variational Inequality Arising from Stochastic Programming

We consider a two-stage stochastic variational inequality arising from a general convex two-stage stochastic programming problem, where the random variables have continuous distributions. The equivalence between the two problems is shown under some moderate conditions, and the monotonicity of the two-stage stochastic variational inequality is discussed under additional conditions. We provide a discretization scheme with convergence results and employ the progressive hedging method with double parameterization to solve the discretized stochastic variational inequality. As an application, we show how the water resources management problem under uncertainty can be transformed from a two-stage stochastic programming problem to a two-stage stochastic variational inequality, and how to solve it, using the discretization scheme and the progressive hedging method with double parameterization.

     

Forward and Backward Mean-Field Stochastic Partial Differential Equation and Optimal Control

This paper is mainly concerned with the solutions to both forward and backward mean-field stochastic partial differential equation and the corresponding optimal control problem for mean-field stochastic partial differential equation. The authors first prove the continuous dependence theorems of forward and backward mean-field stochastic partial differential equations and show the existence and uniqueness of solutions to them. Then they establish necessary and sufficient optimality conditions of the control problem in the form of Pontryagin''s maximum principles. To illustrate the theoretical results, the authors apply stochastic maximum principles to study the infinite-dimensional linear-quadratic control problem of mean-field type. Further, an application to a Cauchy problem for a controlled stochastic linear PDE of mean-field type is studied.     

Use of stochastic control theory to model a forest management system

A forest management problem due to Hellman has been modelled as a stochastic control problem with one state variable (inventory level) and one control variable (consumption rate of wood by the factories). The stochastic process governing the evolution of the inventory level is transformed into an Itô stoachastic differential equation by approximating the compound Poisson process of wood arrivals into the depot as a Wiener process. The resulting stochastic control problem is solved by using the Hamilton-Jacobi-Bellman equation of stochastic dynamic programming. Two numerical examples illustrate the results.     

About stability of difference equations with square summable level of stochastic perturbations

Abstract

This article continues stability investigation of systems with fading stochastic perturbations. In recent results for systems with the continuous time, it was shown that if stochastic perturbations fade on the infinity quickly enough then asymptotically stable deterministic system remains to be an asymptotically mean square stable independently of the magnitude of the intensity maximum of these stochastic perturbations. Here similar statements are obtained for systems with the discrete time by the condition that the level of stochastic perturbations is given by a square summable sequence. Besides the unsolved problem is proposed: is it possible to get analogous results with not so quickly fading stochastic perturbations. This problem is an open problem and for systems with the continuous time too.     

Global Uniqueness for an Inverse Stochastic Hyperbolic Problem with Three Unknowns

This paper is addressed to an inverse stochastic hyperbolic problem with three unknowns, i.e., a random force intensity, an initial displacement, and an initial velocity. The global uniqueness for this inverse problem is proved by means of a new global Carleman estimate for the stochastic hyperbolic equation. It is found that both the formulation of stochastic inverse problems and the tools to solve them differ considerably from their deterministic counterpart. © 2015 Wiley Periodicals, Inc.     

A new regularized stochastic approximation framework for stochastic inverse problems

We study the nonlinear inverse problem of estimating stochastic parameters in the fourth-order partial differential equation with random data. The primary focus is on developing a novel stochastic approximation framework for inverse problems consisting of three key components. As a first step, we reformulate the inverse problem into a stochastic convex optimization problem. The second step includes developing a new regularized stochastic extragradient framework for a nonlinear variational inequality, which subsumes the optimality conditions for the optimization formulation of the inverse problem. The third step involves modeling random variables by a Karhunen–Loève type finite-dimensional noise representation, allowing the direct and the inverse problems to be conveniently discretized. We show that the regularized extragradient methods are strongly convergent in a Hilbert space setting, and we also provide several auxiliary results for the inverse problem, including Lipschitz continuity and a derivative characterization of the solution map. We provide the outcome of computational experiments to estimate stochastic and deterministic parameters. The numerical results demonstrate the feasibility and effectiveness of the developed framework and validate stochastic approximation as an effective method for stochastic inverse problems.     

On an Alternative Parameterization of the Solutions of the Partial Realization Problem

The solutions of the partial realization problem have to satisfy a finite number of interpolation conditions at . The minimal degree of an interpolating deterministic system is called the algebraic degree or McMillan degree of the partial covariance sequence and is easy to compute. The solutions of the partial stochastic realization problem have to satisfy the same interpolation conditions and have to fulfill a positive realness constraint. The minimal degree of a stochastic realization is called the positive degree. In the literature, solutions of the partial realization problem are parameterized by the Kimura–Georgiou parameterization. Solutions of the partial stochastic realization problem are then obtained by checking the positive realness constraint for the interpolating solutions of the corresponding partial realization problem. In this paper, an alternative parameterization is developed for the solutions of the partial realization problems. Both the solutions of the partial and partial stochastic realization problem are analyzed in this parameterization, while the main concerns are the minimality and the uniqueness of the solutions. Based on the structure of the parameterization, a lower bound for the positive degree is derived.     

Adaptive Stabilization of Nonlinear Stochastic Systems

The purpose of this paper is to study the problem of asymptotic stabilization in probability of nonlinear stochastic differential systems with unknown parameters. With this aim, we introduce the concept of an adaptive control Lyapunov function for stochastic systems and we use the stochastic version of Artstein's theorem to design an adaptive stabilizer. In this framework the problem of adaptive stabilization of a nonlinear stochastic system is reduced to the problem of asymptotic stabilization in probability of a modified system. The design of an adaptive control Lyapunov function is illustrated by the example of adaptively quadratically stabilizable in probability stochastic differential systems. Accepted 9 December 1996     

On the numerical structure preservation of nonlinear damped stochastic oscillators

The paper is focused on analyzing the conservation issues of stochastic ??-methods when applied to nonlinear damped stochastic oscillators. In particular, we are interested in reproducing the long-term properties of the continuous problem over its discretization through stochastic ??-methods, by preserving the correlation matrix. This evidence is equivalent to accurately maintaining the stationary density of the position and the velocity of a particle driven by a nonlinear deterministic forcing term and an additive noise as a stochastic forcing term. The provided analysis relies on a linearization of the nonlinear problem, whose effectiveness is proved theoretically and numerically confirmed.

     

The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study

The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 2¹⁶⁹⁴ scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time.     

A maximum principle for fully coupled stochastic control systems of mean-field type

The present paper considers an optimal control problem for fully coupled forward–backward stochastic differential equations (FBSDEs) of mean-field type in the case of controlled diffusion coefficient. Moreover, the control domain is not assumed to be convex. By virtue of a reduction method, we establish the necessary optimality conditions of Pontryagin's type. As an application, a linear–quadratic stochastic control problem is studied.     

On Quantum Stochastic Differential Equations as Dirac Boundary-Value Problems

We prove that a single-jump unitary quantum stochastic evolution is unitarily equivalent to the Dirac boundary-value problem on the half-line in an extended space. It is shown that this solvable model can be derived from the Schrödinger boundary-value problem for a positive relativistic Hamiltonian on the half-line as the inductive ultrarelativistic limit corresponding to the input flow of Dirac particles with asymptotically infinite momenta. Thus the problem of stochastic approximation can be reduced to a quantum mechanical boundary-value problem in the extended space. The problem of microscopic time reversibility is also discussed in the paper.     

Two storage inventory model in a mixed environment

Multi-item inventory models with two storage facility and bulk release pattern are developed with linearly time dependent demand in a finite time horizon under crisp, stochastic and fuzzy-stochastic environments. Here different inventory parameters—holding costs, ordering costs, purchase costs, etc.—are assumed as probabilistic or fuzzy in nature. In particular cases stochastic and crisp models are derived. Models are formulated as profit maximization principle and three different approaches are proposed for solution. In the first approach, fuzzy extension principle is used to find membership function of the objective function and then it’s Graded Mean Integration Value (GMIV) for different optimistic levels are taken as equivalent stochastic objectives. Then the stochastic model is transformed to a constraint multi-objective programming problem using Stochastic Non-linear Programming (SNLP) technique. The multi-objective problems are transferred to single objective problems using Interactive Fuzzy Satisfising (IFS) technique. Finally, a Region Reducing Genetic Algorithm (RRGA) based on entropy has been developed and implemented to solve the single objective problems. In the second approach, the above GMIV (which is stochastic in nature) is optimized with some degree of probability and using SNLP technique model is transferred to an equivalent single objective crisp problem and solved using RRGA. In the third approach, objective function is optimized with some degree of possibility/necessity and following this approach model is transformed to an equivalent constrained stochastic programming problem. Then it is transformed to an equivalent single objective crisp problem using SNLP technique and solved via RRGA. The models are illustrated with some numerical examples and some sensitivity analyses have been presented.     

A viability theorem of stochastic semilinear evolution equations

A viability theorem of stochastic semilinear evolution equations is discussed under a dissipative condition in terms of uniqueness functions and a stochastic subtangential condition. Our strategy is to interpret a stochastic viability problem into a characterization problem of evolution operators associated with stochastic semilinear evolution equations. The main theorem is a generalization of the results due to Aubin and Da Prato in the case of stochastic differential equations in ℝ ^d .     

Topology optimization of plane frames in case of random external loadings

Using the first collapse–theorem, the necessary and sufficient survival conditions of an elasto–plastic structure consist of the yield condition and the equilibrium condition. In practical applications several random model parameters have to be taken into account. This leads to a stochastic optimization problem which cannot be solved using the traditional methods. Instead of that, appropriate (deterministic) substitute problems must be formulated. Here, the topology optimization of frames is considered, where the external load is supposed to be stochastic. The recourse problem will be formulated in general and in the standard form of stochastic linear programming (SLP). After the formulation of the stochastic optimization problem, the recourse problem with discretization and the expected value problem are introduced as representatives of substitute problems. Subsequently, numerical results using these methods are presented. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Asymptotic behavior of solutions: An application to stochastic NLP

In this article we study the consistency of optimal and stationary (KKT) points of a stochastic non-linear optimization problem involving expectation functionals, when the underlying probability distribution associated with the random variable is weakly approximated by a sequence of random probability measures. The optimization model includes constraints with expectation functionals those are not captured in direct application of the previous results on optimality conditions exist in the literature. We first study the consistency of stationary points of a general NLP problem with convex and locally Lipschitz data and then apply those results to the stochastic NLP problem and stochastic minimax problem. Moreover, we derive an exponential bound for such approximations using a large deviation principle.

     

On the ERM formulation and a stochastic approximation algorithm of the stochastic-R_0 EVLCP

In this paper, a class of stochastic extended vertical linear complementarity problems is studied as an extension of the stochastic linear complementarity problem. The expected residual minimization (ERM) formulation of this stochastic extended vertical complementarity problem is proposed based on an NCP function. We study the corresponding properties of the ERM problem, such as existence of solutions, coercive property and differentiability. Finally, we propose a descent stochastic approximation method for solving this problem. A comprehensive convergence analysis is given. A number of test examples are constructed and the numerical results are presented.     

Probabilistic approach to free boundary problems and pricing of American options

In this paper, we discuss a probabilistic approach to construction of a solution of a free boundary problem for parabolic and integro-differential equations. This problem admits an interpretation as an optimization problem for a stochastic process with diffusion and jumps satisfying a stochastic differential equation. The results are applied to calculation of American option prices in the Black–Scholes and Merton models. Bibliography: 22 titles.