Discrete Approximation of differential two-stage stochastic linear complementarity problems

This paper studies differential two-stage stochastic linear complementarity problems, in which an ordinary differential equation (ODE) is coupled with a two-stage stochastic linear complementarity problem (SLCP) under a time-dependent probability distribution. The right-hand side of the ODE involves a solution pair (here-and-now and wait-and-see decisions) of the two-stage SLCP, while the two-stage SLCP involves two functions depending on the time $t$ and the state $x(t)$ of the ODE. Under appropriate conditions, we prove that the solution function of the two-stage SLCP is Lipschitz continuous in $x(t)$ and locally $\frac{1}{2}$-Hölder continuous in $t$, and establish the existence and uniqueness of a classical solution to the differential two-stage SLCP. Moreover, we develop a discrete approximation scheme for the differential two-stage SLCP. We first use a finite-scenario partition with mesh size $δ_N$ to approximate the distribution, then apply the Euler method for time discretization with step size $h$, and finally solve the resulting finite-dimensional problems using an inexact progressive hedging method with tolerance $η$. We prove that the error between a computed solution by the discrete approximation scheme and the classical solution of the original problem is bounded by $C(δ_N+h+η)$, where $C>0$ is a constant independent of $N$, $h$ and $η$. Finally, we apply our method to find an equilibrium point of a differential two-stage stochastic two-player zero-sum game. Numerical experiments illustrate the convergence rates and the efficiency of the discrete approximation scheme.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-12
DOI
https://doi.org/10.48550/arxiv.2611.16501
Primary Topic
Optimization and Variational Analysis
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Discrete Approximation of differential two-stage stochastic linear complementarity problems

Jian Guo, Xiaojun Chen, Seungjun Lee
arXiv (Cornell University)
Optimization and Variational Analysis
preprint

Discrete Approximation of differential two-stage stochastic linear complementarity problems

Jian Guo, Xiaojun Chen, Seungjun Lee
preprint en

Abstract

This paper studies differential two-stage stochastic linear complementarity problems, in which an ordinary differential equation (ODE) is coupled with a two-stage stochastic linear complementarity problem (SLCP) under a time-dependent probability distribution. The right-hand side of the ODE involves a solution pair (here-and-now and wait-and-see decisions) of the two-stage SLCP, while the two-stage SLCP involves two functions depending on the time $t$ and the state $x(t)$ of the ODE. Under appropriate conditions, we prove that the solution function of the two-stage SLCP is Lipschitz continuous in $x(t)$ and locally $\frac{1}{2}$-Hölder continuous in $t$, and establish the existence and uniqueness of a classical solution to the differential two-stage SLCP. Moreover, we develop a discrete approximation scheme for the differential two-stage SLCP. We first use a finite-scenario partition with mesh size $δ_N$ to approximate the distribution, then apply the Euler method for time discretization with step size $h$, and finally solve the resulting finite-dimensional problems using an inexact progressive hedging method with tolerance $η$. We prove that the error between a computed solution by the discrete approximation scheme and the classical solution of the original problem is bounded by $C(δ_N+h+η)$, where $C>0$ is a constant independent of $N$, $h$ and $η$. Finally, we apply our method to find an equilibrium point of a differential two-stage stochastic two-player zero-sum game. Numerical experiments illustrate the convergence rates and the efficiency of the discrete approximation scheme.

arXiv (Cornell University)
Optimization and Variational Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon