82,377 research outputs found
Simulation-based solution of stochastic mathematical programs with complementarity constraints: Sample-path analysis
We consider a class of stochastic mathematical programs with complementarity constraints, in which both the objective and the constraints involve limit functions or expectations that need to be estimated or approximated. Such programs can be used for modeling \\average" or steady-state behavior of complex stochastic systems. Recently, simulation-based methods have been successfully used for solving challenging stochastic optimization problems and equilibrium models. Here we broaden the applicability of so-called the sample-path method to include the solution of certain stochastic mathematical programs with equilibrium constraints. The convergence analysis of sample-path methods rely heavily on stability conditions. We first review necessary sensitivity results, then describe the method, and provide sufficient conditions for its almost-sure convergence. Alongside we provide a complementary sensitivity result for the corresponding deterministic problems. In addition, we also provide a unifying discussion on alternative set of sufficient conditions, derive a complementary result regarding the analysis of stochastic variational inequalities, and prove the equivalence of two different regularity conditions.simulation;mathematical programs with equilibrium constraints;stability;regularity conditions;sample-path methods;stochastic mathematical programs with complementarity constraints
Simulation-Based Solution of Stochastic Mathematical Programs with Complementarity Constraints: Sample-Path Analysis
We consider a class of stochastic mathematical programs with complementarity constraints, in which both the objective and the constraints involve limit functions or expectations that need to be estimated or approximated.Such programs can be used for modeling average or steady-state behavior of complex stochastic systems.Recently, simulation-based methods have been successfully used for solving challenging stochastic optimization problems and equilibrium models.Here we broaden the applicability of so-called the sample-path method to include the solution of certain stochastic mathematical programs with equilibrium constraints.The convergence analysis of sample-path methods rely heavily on stability conditions.We first review necessary sensitivity results, then describe the method, and provide sufficient conditions for its almost-sure convergence.Alongside we provide a complementary sensitivity result for the corresponding deterministic problems.In addition, we also provide a unifying discussion on alternative set of sufficient conditions, derive a complementary result regarding the analysis of stochastic variational inequalities, and prove the equivalence of two different regularity conditions.stochastic processes;mathematics;stability;simulation;regulations;general equilibrium
Simulation-based solution of stochastic mathematical programs with complementarity constraints: Sample-path analysis
We consider a class of stochastic mathematical programs with complementarity constraints, in which both the objective and the constraints involve limit functions or expectations that need to be estimated or approximated. Such programs can be used for modeling \\average" or steady-state behavior of complex stochastic systems. Recently, simulation-based methods have been successfully used for solving challenging stochastic optimization problems and equilibrium models. Here we broaden the applicability of so-called the sample-path method to include the solution of certain stochastic mathematical programs with equilibrium constraints. The convergence analysis of sample-path methods rely heavily on stability conditions. We first review necessary sensitivity results, then describe the method, and provide sufficient conditions for its almost-sure convergence. Alongside we provide a complementary sensitivity result for the corresponding deterministic problems. In addition, we also provide a unifying discussion on alternative set of sufficient conditions, derive a complementary result regarding the analysis of stochastic variational inequalities, and prove the equivalence of two different regularity conditions
Simulation-based solution of stochastic mathematical programs with complementarity constraints: sample-path analyis
We consider a class of stochastic mathematical programs with
complementarity constraints, in which both the objective and the
constraints involve limit functions or expectations that need to be
estimated or approximated. Such programs can be used for modeling
"average" or steady-state behavior of complex stochastic
systems. Recently, simulation-based methods have been successfully
used for solving challenging stochastic optimization problems and
equilibrium models. Here we broaden the applicability of so-called
the sample-path method to include the solution of certain stochastic
mathematical programs with equilibrium constraints. The convergence
analysis of sample-path methods rely heavily on stability
conditions. We first review necessary sensitivity results, then
describe the method, and provide sufficient conditions for its
almost-sure convergence. Alongside we provide a complementary
sensitivity result for the corresponding deterministic problems. In
addition, we also provide a unifying discussion on alternative set of
sufficient conditions, derive a complementary result regarding the
analysis of stochastic variational inequalities, and prove the
equivalence of two different regularity conditions
Linearly Solvable Stochastic Control Lyapunov Functions
This paper presents a new method for synthesizing stochastic control Lyapunov
functions for a class of nonlinear stochastic control systems. The technique
relies on a transformation of the classical nonlinear Hamilton-Jacobi-Bellman
partial differential equation to a linear partial differential equation for a
class of problems with a particular constraint on the stochastic forcing. This
linear partial differential equation can then be relaxed to a linear
differential inclusion, allowing for relaxed solutions to be generated using
sum of squares programming. The resulting relaxed solutions are in fact
viscosity super/subsolutions, and by the maximum principle are pointwise upper
and lower bounds to the underlying value function, even for coarse polynomial
approximations. Furthermore, the pointwise upper bound is shown to be a
stochastic control Lyapunov function, yielding a method for generating
nonlinear controllers with pointwise bounded distance from the optimal cost
when using the optimal controller. These approximate solutions may be computed
with non-increasing error via a hierarchy of semidefinite optimization
problems. Finally, this paper develops a-priori bounds on trajectory
suboptimality when using these approximate value functions, as well as
demonstrates that these methods, and bounds, can be applied to a more general
class of nonlinear systems not obeying the constraint on stochastic forcing.
Simulated examples illustrate the methodology.Comment: Published in SIAM Journal of Control and Optimizatio
Bounds for deterministic and stochastic dynamical systems using sum-of-squares optimization
We describe methods for proving upper and lower bounds on infinite-time
averages in deterministic dynamical systems and on stationary expectations in
stochastic systems. The dynamics and the quantities to be bounded are assumed
to be polynomial functions of the state variables. The methods are
computer-assisted, using sum-of-squares polynomials to formulate sufficient
conditions that can be checked by semidefinite programming. In the
deterministic case, we seek tight bounds that apply to particular local
attractors. An obstacle to proving such bounds is that they do not hold
globally; they are generally violated by trajectories starting outside the
local basin of attraction. We describe two closely related ways past this
obstacle: one that requires knowing a subset of the basin of attraction, and
another that considers the zero-noise limit of the corresponding stochastic
system. The bounding methods are illustrated using the van der Pol oscillator.
We bound deterministic averages on the attracting limit cycle above and below
to within 1%, which requires a lower bound that does not hold for the unstable
fixed point at the origin. We obtain similarly tight upper and lower bounds on
stochastic expectations for a range of noise amplitudes. Limitations of our
methods for certain types of deterministic systems are discussed, along with
prospects for improvement.Comment: 25 pages; Added new Section 7.2; Added references; Corrected typos;
Submitted to SIAD
- …