A Stochastic Linear Quadratic Optimal Control Problem with Generalized Expectation

Abstract

In this article, we initiate a study on optimal control problem for linear stochastic differential equations with quadratic cost functionals under generalized expectation via backward stochastic differential equations.     

On consistency of stationary points of stochastic optimization problems in a Banach space

Recently, Balaji and Xu studied the consistency of stationary points, in the sense of the Clarke generalized gradient, for the sample average approximations to a one-stage stochastic optimization problem in a separable Banach space with separable dual. We present an alternative approach, showing that the restrictive assumptions that the dual space is separable and the Clarke generalized gradient is a (norm) upper semicontinuous and compact-valued multifunction can be dropped. For that purpose, we use two results having independent interest: a strong law of large numbers and a multivalued Komlós theorem in the dual to a separable Banach space, and a result on the weak* closedness of the expectation of a random weak* compact convex set.     

A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization

In this paper, a novel stochastic extra-step quasi-Newton method is developed to solve a class of nonsmooth nonconvex composite optimization problems. We assume that the gradient of the smooth part of the objective function can only be approximated by stochastic oracles. The proposed method combines general stochastic higher order steps derived from an underlying proximal type fixed-point equation with additional stochastic proximal gradient steps to guarantee convergence. Based on suitable bounds on the step sizes, we establish global convergence to stationary points in expectation and an extension of the approach using variance reduction techniques is discussed. Motivated by large-scale and big data applications, we investigate a stochastic coordinate-type quasi-Newton scheme that allows to generate cheap and tractable stochastic higher order directions. Finally, numerical results on large-scale logistic regression and deep learning problems show that our proposed algorithm compares favorably with other state-of-the-art methods.

     

Two-stage stochastic programming under multivariate risk constraints with an application to humanitarian relief network design

In this study, we consider two classes of multicriteria two-stage stochastic programs in finite probability spaces with multivariate risk constraints. The first-stage problem features multivariate stochastic benchmarking constraints based on a vector-valued random variable representing multiple and possibly conflicting stochastic performance measures associated with the second-stage decisions. In particular, the aim is to ensure that the decision-based random outcome vector of interest is preferable to a specified benchmark with respect to the multivariate polyhedral conditional value-at-risk or a multivariate stochastic order relation. In this case, the classical decomposition methods cannot be used directly due to the complicating multivariate stochastic benchmarking constraints. We propose an exact unified decomposition framework for solving these two classes of optimization problems and show its finite convergence. We apply the proposed approach to a stochastic network design problem in the context of pre-disaster humanitarian logistics and conduct a computational study concerning the threat of hurricanes in the Southeastern part of the United States. The numerical results provide practical insights about our modeling approach and show that the proposed algorithm is computationally scalable.

     

Asymptotic Analysis of Sample Average Approximation for Stochastic Optimization Problems with Joint Chance Constraints via Conditional Value at Risk and Difference of Convex Functions

Conditional Value at Risk (CVaR) has been recently used to approximate a chance constraint. In this paper, we study the convergence of stationary points, when sample average approximation (SAA) method is applied to a CVaR approximated joint chance constrained stochastic minimization problem. Specifically, we prove under some moderate conditions that optimal solutions and stationary points, obtained from solving sample average approximated problems, converge with probability one to their true counterparts. Moreover, by exploiting the recent results on large deviation of random functions and sensitivity results for generalized equations, we derive exponential rate of convergence of stationary points. The discussion is also extended to the case, when CVaR approximation is replaced by a difference of two convex functions (DC-approximation). Some preliminary numerical test results are reported.     

Stability analysis for stochastic programs

For stochastic programs with recourse and with (several joint) probabilistic constraints, respectively, we derive quantitative continuity properties of the relevant expectation functionals and constraint set mappings. This leads to qualitative and quantitative stability results for optimal values and optimal solutions with respect to perturbations of the underlying probability distributions. Earlier stability results for stochastic programs with recourse and for those with probabilistic constraints are refined and extended, respectively. Emphasis is placed on equipping sets of probability measures with metrics that one can handle in specific situations. To illustrate the general stability results we present possible consequences when estimating the original probability measure via empirical ones.     

Generalized Modulated Random Measures and Their Potentials

Abstract

This article deals with a class of random measures formed of doubly stochastic marked random measures that assumes parameters in accordance with the evolution of some stochastic process, called a “modulator.” Throughout the paper, restrictions imposed on random measures (to be modulated) and the modulator are kept to a minimum. One of the objective of these studies are intensities and reward rates of modulated random measures that can play a significant role in stochastic control and optimization. Analytically tractable formulas for such functionals are obtained and examples and applications are discussed and treated in details.     

Polynomial type large deviation inequalities and quasi-likelihood analysis for stochastic differential equations

The estimate of the probability of the large deviation or the statistical random field is the key to ensure the convergence of moments of the associated estimator, and it also plays an essential role to prove mathematical validity of the asymptotic expansion of the estimator. For non-linear stochastic processes, it involves technical difficulties to show a standard exponential type estimate; besides, it is not necessary for these purposes. In this paper, we propose a polynomial-type large deviation inequality which is easily verified by the L ^p -boundedness of certain functionals; usually they are simple additive functionals. We treat a statistical random field with multi-grades and discuss M and Bayesian type estimators. As an application, we show the behavior of those estimators, including convergence of moments, for the statistical random field in the quasi-likelihood analysis of the stochastic differential equation that is possibly multi-dimensional and non-linear. The results are new even for stochastic differential equations, while they obviously apply to other various statistical models.     

Subregular recourse in nonlinear multistage stochastic optimization

We consider nonlinear multistage stochastic optimization problems in the spaces of integrable functions. We allow for nonlinear dynamics and general objective functionals, including dynamic risk measures. We study causal operators describing the dynamics of the system and derive the Clarke subdifferential for a penalty function involving such operators. Then we introduce the concept of subregular recourse in nonlinear multistage stochastic optimization and establish subregularity of the resulting systems in two formulations: with built-in nonanticipativity and with explicit nonanticipativity constraints. Finally, we derive optimality conditions for both formulations and study their relations.

     

Investment with Sequence Losses in an Uncertain Environment and Mean-Variance Hedging

Abstract

In a market with a discontinuous filtration, whose price is influenced by a random factor, we study an optimization problem of an investor who is facing a sequence of losses driven by a Cox process. We give a form of variance-optimal martingale measure by changing the filtration. By using the solutions of the stochastic Riccati equation and another associated backward stochastic equation, we obtain a solution of the optimization problem of the investor.     

Expected Value and Sample Average Approximation Method for Solving Stochastic Second-Order Cone Complementarity Problems

In this paper, we consider the stochastic second-order cone complementarity problems (SSOCCP). We first formulate the SSOCCP contained expectation as an optimization problem using the so-called second-order cone complementarity function. We then use sample average approximation method and smoothing technique to obtain the approximation problems for solving this reformulation. In theory, we show that any accumulation point of the global optimal solutions or stationary points of the approximation problems are global optimal solution or stationary point of the original problem under suitable conditions. Finally, some numerical examples are given to explain that the proposed methods are feasible.     

Multivariate robust second-order stochastic dominance and resulting risk-averse optimization

ABSTRACT

By utilizing a min-biaffine scalarization function, we define the multivariate robust second-order stochastic dominance relationship to flexibly compare two random vectors. We discuss the basic properties of the multivariate robust second-order stochastic dominance and relate it to the nonpositiveness of a functional which is continuous and subdifferentiable everywhere. We study a stochastic optimization problem with multivariate robust second-order stochastic dominance constraints and develop the necessary and sufficient conditions of optimality in the convex case. After specifying an ambiguity set based on moments information, we approximate the ambiguity set by a series of sets consisting of discrete distributions. Furthermore, we design a convex approximation to the proposed stochastic optimization problem with multivariate robust second-order stochastic dominance constraints and establish its qualitative stability under Kantorovich metric and pseudo metric, respectively. All these results lay a theoretical foundation for the modelling and solution of complex stochastic decision-making problems with multivariate robust second-order stochastic dominance constraints.     

Convergence analysis of stationary points in sample average approximation of stochastic programs with second order stochastic dominance constraints

Sample average approximation (SAA) method has recently been applied to solve stochastic programs with second order stochastic dominance (SSD) constraints. In particular, Hu et al. (Math Program 133:171–201, 2012) presented a detailed convergence analysis of $\epsilon $ -optimal values and $\epsilon $ -optimal solutions of sample average approximated stochastic programs with polyhedral SSD constraints. In this paper, we complement the existing research by presenting convergence analysis of stationary points when SAA is applied to a class of stochastic minimization problems with SSD constraints. Specifically, under some moderate conditions we prove that optimal solutions and stationary points obtained from solving sample average approximated problems converge with probability one to their true counterparts. Moreover, by exploiting some recent results on large deviation of random functions and sensitivity analysis of generalized equations, we derive exponential rate of convergence of stationary points.     

Time-Changed Processes Governed by Space-Time Fractional Telegraph Equations

We study global and local stabilities of the stationary zero solution to certain infinite-dimensional stochastic differential equations. The stabilities are in terms of fractional powers of the linear part of the drift. The abstract results are applied to semilinear stochastic partial differential equations with non-Lipschitzian drift terms and, in particular, to some specific models of population dynamics. We also expose the stabilizing effect of noise on the otherwise unstable zero solution

As a basic tool we use the Forward Inequality, a generalization of Kolmogorov's forward equation; it is an application of Lyapunov's second method with a sequence of Lyapunov functionals     

Approximating stationary points of stochastic optimization problems in Banach space

In this paper, we present a uniform strong law of large numbers for random set-valued mappings in separable Banach space and apply it to analyze the sample average approximation of Clarke stationary points of a nonsmooth one stage stochastic minimization problem in separable Banach space. Moreover, under Hausdorff continuity, we show that with probability approaching one exponentially fast with the increase of sample size, the sample average of a convex compact set-valued mapping converges to its expected value uniformly. The result is used to establish exponential convergence of stationary sequence under some metric regularity conditions.     

Inequalities in a Two-Sided Boundary Crossing Problem for Stochastic Processes

Considering a stationary stochastic process with independent increments (Lévy process), we study the probability of the first exit from a strip through its upper boundary. We find the two-sided inequalities for this probability under various conditions on the process.

     

Quantitative stability of full random two-stage problems with quadratic recourse

ABSTRACT

In this paper, we discuss quantitative stability of two-stage stochastic programs with quadratic recourse where all parameters in the second-stage problem are random. By establishing the Lipschitz continuity of the feasible set mapping of the restricted Wolfe dual of the second-stage quadratic programming in terms of the Hausdorff distance, we prove the local Lipschitz continuity of the integrand of the objective function of the two-stage stochastic programming problem and then establish quantitative stability results of the optimal values and the optimal solution sets when the underlying probability distribution varies under the Fortet–Mourier metric. Finally, the obtained results are applied to study the asymptotic behaviour of the empirical approximation of the model.     

Conditional expectation of integrands and random sets

The conditional expectation of integrands and random sets is the main tool of stochastic optimization. This work wishes to make up for the lack of real synthesis about this subject. We improve the existing hypothesis and simplify the corresponding proofs. In the convex case we especially study the problem of the exchange of conditional expectation and subdifferential operators.     

Stationary probability distributions of some lotka-volterra types of stochastic predation systems

This paper provides exact solutions to the stationary probability distributions in some stochastic predation systems. These are derived by solving the Fokker-Planck equations for:

(i) a generalized stochastic Lotka-Volterra predator-prey system, and

(ii) a generalised stochastic Lotka-Volterra food chain.

In all these systems the growth dynamics of all levels of species are subject to stochastic shocks. Since stationary probability distributions provide the most comprehensive characterization of a stochastic system in a steady state, system stability can be analysed accordingly     

Singularity among selfsimilar Gaussian random fields with different scaling parameters and others

Abstract

It is shown in this paper that the probability measures generated by selfsimilar Gaussian random fields are mutually singular, whenever they have different scaling parameters. So are those generated from a selfsimilar Gaussian random field and a stationary Gaussian random field. Certain conditions are also given for the singularity of the probability measures generated from two Gaussian random fields whose covariance functions are Schoenberg–Lévy kernels, and for those from stationary Gaussian random fields with spectral densities.