Pith.

Optimization and Control · arXiv:2611.16501 v1 · submitted 12 Nov 2026 · 41 references

Discrete Approximation of differential two-stage stochastic linear complementarity problems

Xiaojun Chen, Jian Guo, Seungjun Lee

The paper says

“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.”

more of the abstract

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 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.

from the abstract

Pith says

Machine review · deepseek-v4-flash · 13 Nov 2026 · what was read was not recorded · not checked by a person

It can be wrong. Challenge this review or reply to it.

Holds up. Solid, rigorous extension of differential variational inequalities to two-stage stochastic complementarity under time-dependent distributions, with a clean error analysis and numerical support. This line is wrong

6 minor

How often objections from reviews like this one are right: not yet measured

Are you an author? What you can do.

Not checked: figures, code, what the 41 references say.

6 minor objections

The paper says, at Figure 1

Pith says: minor objection 1 of 6

The tick labels in the left panel (e.g., '2!72!52!2 /N') and the middle panel ('0:01250:050:2') appear garbled in the arXiv plain text. The same problem occurs in Figure 2 ('10!60:0035') and Figure 3. The authors should ensure that the figures render correctly in the final version.

The paper says, at Page 19, equation labels

Pith says: minor objection 2 of 6

The sentence 'The symmetric part of M(ξ) is uniformly positive definite' is used in Example 2; the paper should clarify that this is a consequence of the full-row-rank assumption on R and the positive definiteness of the symmetric part of Γ(ξ)^{-1}, not a direct consequence of (4.6) alone.

show 4 more

The paper says, at Page 11, line after (3.2)

Pith says: minor objection 3 of 6

The text says 'the same applies to the finite-scenario problems introduced below' but the notation HP^N_t is used only later. Consider moving the definition of HP^N_t earlier for clarity.

The paper says, at Page 6, eq. (2.3)

Pith says: minor objection 4 of 6

In the bound ∥u_{y,g}(ξ)∥ ≤ (∥M_{21}(ξ)∥∥y∥+∥g(ξ)∥)/κ(ξ), the denominator should be κ(ξ) as written, but note that in the proof the estimate uses ∥u−u′∥ ≤ (∥M_{21}∥∥y−y′∥+∥g−g′∥)/κ(ξ). This is consistent.

The paper says, at Page 19, Example 1

Pith says: minor objection 5 of 6

The statement 'If σ(ξ) > 0 on a set of positive P_t-measure, the splittings (ν_{x,1}, ν_{x,2}) = (ϑσ, (1−ϑ)σ), ϑ∈[0,1], give distinct multipliers' is correct, but it might be helpful to note that this implies the unregularized operator is not strongly monotone, motivating the regularization.

The paper says, at References

Pith says: minor objection 6 of 6

Reference [7] is listed as 'Differential stochastic variational inequalities with parametric optimization, SIAM J. Optim. (2026), To appear.' If the paper has been accepted, the authors should update the reference with the volume and page numbers if available.

What would settle it

Instantiate the constants C4 and C5 in Theorem 3.5 for the numerical setting of Example 1 with regularization α=1e-2 (so ε=1e-2), using the explicit bounds in Assumptions 1.1–1.5 and 3.1. Compute the theoretical error bound C4(δ_N+h+η) and compare it to the observed state errors in Figures 1(a)–(c) at the coarsest refinement levels. This check confirms that the proven constants are not vacuous and that the error bound indeed dominates the empirical errors.

from the skeptic's reading

How the review went

4 readings by deepseek-v4-flash · 13 Nov 2026

  1. Reader holds up confidence high
  2. Skeptic agrees 49 s · 32,439 tokens read, 6,097 written
  3. Editor wrote the verdict above 10 s · 33,149 tokens read, 1,052 written
  4. Referee minor revision: 6 minor 21 s · 32,718 tokens read, 2,299 written

Not run on this paper: the simulated authors' defence.

Pith did not check this review's objections against the paper.

The review in full

The review in brief, machine-written

This paper does what it sets out to do: it couples an ODE with a two-stage stochastic linear complementarity problem under a time-dependent distribution, proves existence and uniqueness of a classical solution under stated assumptions, and delivers a full error bound C(δN + h + η) for a practical discrete approximation (scenario partition + Euler + inexact progressive hedging). The joint moment conditions (Assumption 1.5) are technical but the counterexamples in Remark 2.6 show they cannot be dropped, which is honest. The numerical experiments confirm the predicted first-order rates under strong monotonicity and also test a case without it (Example 2), where convergence still occurs—the authors flag this as a limitation, which is appropriate.

The main soft spot is the reliance on strong monotonicity of the block matrix (Assumption 1.2). This is essential for uniqueness and the Lipschitz estimates. The paper acknowledges that the theory does not cover the monotone but not strongly monotone case, and the numerical example without it is just empirical. Another minor point: the paper cites several unpublished or 'to appear' works (e.g., [6], [36]); these are from the same group and likely legitimate, but a referee might want to check that the cited results are substantiated. The total variation Lipschitz assumption on Pt is strong but manageable for applications like energy with rolling forecasts.

The writing is clear, the proofs are detailed but not bloated, and the constant tracking in the error analysis is explicit enough to be useful. This is a niche contribution within differential variational inequalities and stochastic complementarity, but it is a genuine extension and well worked out.

I would bring this to a reading group if the focus is on DVI theory or stochastic equilibrium. I would cite it if I worked on similar problems. A serious editor should send this to peer review. The paper is coherent on its own terms and deserves a fair referee.

The strongest objection

The paper's central claims—existence and uniqueness of classical solution under Assumptions 1.1–1.5, and O(δ_N+h+η) error bound under Assumptions 1.4 and 3.1—are supported by detailed, internally consistent proofs. The assumptions are clearly stated, and their necessity is illustrated by counterexamples (Remark 2.6). The numerical experiments confirm the theoretical rates under strong monotonicity and show similar behavior in its absence, which the authors acknowledge as a limitation (Section 5). I find no logical gap, hidden assumption, or circular reasoning that would undermine the main results given the stated hypotheses. The reader’s identification of Assumption 1.2 as the weakest assumption is accurate, but the paper is explicit about this condition and does not claim results without it; the theoretical framework is self-consistent.

The reader’s verdict ACCEPT with HIGH confidence is justified. The paper is rigorous, the proofs are detailed, and the assumptions are neither hidden nor circular. The numerical experiments support the theory and honestly show limitations. The stress-test finds no load-bearing concern that would require changing the verdict. The concrete test is a sanity check on the constants, but it is not needed to question the paper’s validity.

The referee's report

If the results hold, the paper provides the first rigorous existence, uniqueness, and discrete approximation theory for differential two-stage SLCPs with time-dependent distributions. This is a nontrivial extension of DVIs and two-stage SVIs, motivated by energy storage and inventory routing applications where both here-and-now and wait-and-see decisions affect the state dynamics. The error analysis is complete—covering scenario discretization, time stepping, and solver tolerance—with constants independent of the partition, step size, and tolerance. The counterexamples in Remark 2.6 convincingly show the necessity of the joint moment conditions. The numerical experiments support the predicted rates and include interesting explorations of regularization and the borderline case without strong monotonicity. The paper is a solid contribution to numerical optimization and stochastic variational inequalities.

Pith's reading of the paper (a machine's summary, not the authors')

This paper studies a system where an ordinary differential equation (ODE) is driven by the solution of a two-stage stochastic linear complementarity problem (SLCP). The SLCP itself depends on time, state, and a time-varying probability distribution. Under natural conditions, the authors prove that this coupled problem has a unique classical solution. They then develop a practical numerical scheme that replaces the continuous distribution with a finite set of scenarios, applies forward Euler time stepping, and solves the resulting subproblems with progressive hedging. The main result is a clean error bound: the approximation error is at most a constant times the sum of the scenario mesh size, the time step, and the solver tolerance.

What carries the argument. The key machinery is the two-stage SLCP solution mapping (y(t,x), u(t,x,·)), which is shown to be Lipschitz in the state and locally 1/2-Hölder in time under the standing assumptions. The vector field F(t,x) = E_{P_t}[Φ(t,x, y(t,x), u(t,x,·), ·)] inherits these continuity properties, guaranteeing existence and uniqueness of the ODE solution. The discrete approximation replaces the continuous distribution by a finite partition of the uncertainty set, applies Euler time stepping, and uses the natural residual of the two-stage LCP as a stopping criterion for the progressive hedging solver. The error analysis combines bounds for scenario approximation, time discretization, and solver tolerance, each of which enters additively and linearly.

Core claim. The central discovery is that the differential two-stage stochastic linear complementarity problem (1.1) admits a unique classical solution when the block matrix M(ξ) satisfies a strong monotonicity condition with a uniform expected lower bound, and when suitable joint moment conditions hold. Moreover, the discrete approximation scheme—scenario partition plus Euler time stepping plus inexact progressive hedging—converges at first order with a total error bounded by C(δ_N + h + η). The constants are independent of the discretization parameters, the scenario partition, and the time-dependent weights. The result is the first provably convergent numerical method for a differential equation coupled with a two-stage stochastic equilibrium constraint under time-dependent distributions.

The premise it rests on. The block matrix M(ξ) must be strongly monotone with a uniform expected modulus κ > 0 (Assumption 1.2); without this, the two-stage SLCP may not have a unique solution and the error bounds collapse, although numerical examples suggest the method still works when the solution is merely unique.

If the paper is right (Pith's inferences, not the authors')

The discrete scheme provides a rigorous numerical method for dynamic systems where both here-and-now and wait-and-see decisions affect the state evolution, such as energy storage scheduling with day-ahead and real-time adjustments.

The first-order error bound C(δ_N + h + η) gives practical guidance for choosing discretization parameters: one can balance scenario mesh, time step, and solver tolerance to achieve a desired accuracy without over-refining any one component.

The framework covers time-dependent probability distributions that are Lipschitz in total variation, enabling models with evolving forecasts or updated information.

The application to two-stage stochastic zero-sum games shows that equilibrium adjustment dynamics can be simulated and converge to the game's KKT points under both regularized and non-regularized settings.

Numerical experiments suggest that the first-order convergence persists even when the strong monotonicity assumption (Assumption 1.2) fails, provided the solution is unique; this hints at a broader theory beyond the paper's main assumptions.

The additive error structure suggests that for a fixed computational budget, the optimal allocation among scenario refinement, time stepping, and solver accuracy can be determined by equating the three contributions, leading to resource-aware algorithm design.

The continuity results for the two-stage SLCP solution in time and state, combined with the change-of-measure estimates, could be used to study sensitivity of the dynamic system to perturbations in the probability law, e.g., in Wasserstein distance.

The failure of strong monotonicity in Example 2 yet continued empirical convergence indicates that the true condition for well-posedness may be monotonicity plus uniqueness of the two-stage SLCP solution, rather than uniform positive definiteness. A future weakening of Assumption 1.2 along these lines would significantly extend the applicability of the theory.

Check this review

Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.

How often reviews like this one are right

Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.

How often objections from reviews like this one are right: not yet measured

Every value above, in the review's public record (JSON)

Reviews by people

This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.

Request a human review

How Pith checks papers · The full audit of this paper

The paper

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 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.

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.

abstract compiled · 2026-11-13

The authors' main claim, as the classifier picked it out 0.60

“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(\delta_N+h+\eta)$, where $C>0$ is a constant independent of $N$, $h$ and $\eta$.”

How the main claim is stated: asserted 1.00

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.17 · human participants 0.02 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.96 · compares with prior results 0.07 · mentions code or data availability 0.02

The abstract, sentence by sentence

This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.

SentenceRoleThe authors' own workStates the main conclusionStrength
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. contribution 0.60 0.54 0.04 asserted 0.98
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. background 0.82 0.28 0.03 asserted 1.00
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\"older continuous in $t$, and establish the existence and uniqueness of a classical solution to the differential two-stage SLCP. result 0.92 0.96 0.38 asserted 1.00
Moreover, we develop a discrete approximation scheme for the differential two-stage SLCP. contribution 0.79 0.96 0.07 asserted 1.00
We first use a finite-scenario partition with mesh size $\delta_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 $\eta$. method 1.00 0.95 0.05 asserted 0.99
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(\delta_N+h+\eta)$, where $C>0$ is a constant independent of $N$, $h$ and $\eta$. result 0.98 0.96 0.41 asserted 1.00
Finally, we apply our method to find an equilibrium point of a differential two-stage stochastic two-player zero-sum game. contribution 0.91 0.96 0.07 asserted 1.00
Numerical experiments illustrate the convergence rates and the efficiency of the discrete approximation scheme. result 0.86 0.95 0.08 asserted 1.00

What kind of paper the classifier reports this is: method or tool 0.56 · evidence from proof or derivation 1.00

What was examined, and what was not

Sources read

  • arXiv listing abstract v1

Not examined

  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers

Levels run

  • P abstract

Not run

  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

How the labels were made

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-13: 1 request, 6,542 input tokens.

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON

Figures (4)
Figure 1 of the paper
Figure 1. Example 1 (α = 10−2 ): State and decision errors as (a) δN decreases, (b) h decreases, and (c) η decreases. Dotted lines indicate first-order convergence. means and sample standard deviations over the 50 instances. These results further support the convergence rates established in Theorems 3.3 and 3.5
Figure 2 of the paper
Figure 2. Example 1: (a) State and decision errors as α decreases, αref = 10−7 ; (b) combined error E as N increases for different α; (c) combined error E as h decreases for different α. (a) Scenario re-nement 2!7 2!5 2!2 /N 10!4 10!2 10 0 Error Ex Ez O(/N ) (b) Time step re-nement 0:2 0:05 0:0125 h 10!2 10!1 10 0 Error Ex Ez O(h) (c) PH tolerance 10!5 3#10!4 10!2 2 10!6 10!4 10!2 Error Ex Ez O(2)
Figure 3 of the paper
Figure 3. Example 2 (α = 0): State and decision errors as (a) δN decreases, (b) h decreases, and (c) η decreases. Dotted lines indicate first-order convergence. Ξ = [−1, 1] into N equal subintervals Ξi . Since P is uniform, the scenario weights are πi = P(Ξi) = 1/N, and the discrete distribution is P N (A) = 1 N PN i=1 1A(ξi), A ∈ B(Ξ). We first examine the convergence to equilibrium using the left endpoints of Ξi as scenario representatives. We set N = 64, h = 0.05, η = 10−10, and T = 10, with five initial states: x (1) 0 = (10, −8, 6)⊤, x (2) 0 = (−18, 15, −16)⊤, x (3) 0 = (30, −25,
Figure 4 of the paper
Figure 4. Example 2: (a) distance to a common numerical equilibrium from five initial states; (b) terminal payoffs VN over 50 runs for each N

Figures are the authors', reproduced from the paper.

References (41)
  1. [6] Xiaojun Chen, Jian Guo, Xin Guo, and Guan Wang,Stability of differential stochastic variational inequalities with history-dependent responses and transfer learning, 2026 on Pith
  2. [36] ,Solutions of two-stage stochastic minimax problems, Math. Program. (2026) on Pith
  3. [1] Hossein Akhavan-Hejazi and Hamed Mohsenian-Rad,Optimal operation of independent storage systems in energy and reserve markets with high wind penetration, IEEE Trans. Smart Grid5(2014), no. 2, 1088–1097 on Pith
  4. [2] John R. Birge and Fran¸ cois Louveaux,Introduction to stochastic programming, 2nd ed., Springer, New York, 2011 on Pith
  5. [3] M. Kanat Camlibel, Jong-Shi Pang, and Jinglai Shen,Conewise linear systems: non-Zenoness and observability, SIAM J. Control Optim.45(2006), 1769–1800 on Pith
  6. [4] Lin Chen, Yongchao Liu, Xinmin Yang, and Jin Zhang,Stochastic approximation methods for the two-stage stochastic linear complementarity problem, SIAM J. Optim.32(2022), no. 3, 2129–2155 on Pith
  7. [5] Xiaojun Chen,Differential stochastic variational inequalities and optimization, Proceedings of the International Congress of Mathematicians 2026, Vol. 7: Invited Lectures (Sections 15–20), SIAM, 2026, pp. 485–505 on Pith
  8. [7] Xiaojun Chen, Jian Guo, and Guan Wang,Differential stochastic variational inequalities with parametric optimization, SIAM J. Optim. (2026), To appear on Pith
  9. [8] Xiaojun Chen, Ting Kei Pong, and Roger J.-B. Wets,Two-stage stochastic variational inequalities: an ERM-solution procedure, Math. Program.165(2017), no. 1, 71–111 on Pith
  10. [9] Xiaojun Chen, Alexander Shapiro, and Hailin Sun,Convergence analysis of sample average approximation of two-stage stochastic generalized equations, SIAM J. Optim.29(2019), 135–161 on Pith
  11. [10] Xiaojun Chen and Jinglai Shen,Dynamic stochastic variational inequalities and convergence of discrete approximation, SIAM J. Optim.32(2022), 2909–2937 on Pith
  12. [11] Xiaojun Chen, Hailin Sun, and Huifu Xu,Discrete approximation of two-stage stochastic and distributionally robust linear complementarity problems, Math. Program.177(2019), no. 1–2, 255–289 on Pith
  13. [12] Xiaojun Chen and Zhengyu Wang,Convergence of regularized time-stepping methods for differential variational inequalities, SIAM J. Optim.23(2013), no. 3, 1647–1671 on Pith
  14. [13] Xiaojun Chen and Shuhuang Xiang,Newton iterations in implicit time-stepping scheme for differential linear complementarity systems, Math. Program.138(2013), no. 1–2, 579–606 on Pith
  15. [14] Xingbang Cui and Liping Zhang,A localized progressive hedging algorithm for solving nonmonotone stochastic variational inequalities, Math. Oper. Res.49(2024), no. 3, 1915–1937 on Pith
  16. [15] Maria Elena De Giuli, Monica Milasi, Giorgia Oggioni, and Domenico Scopelliti,Variational methods for equilibrium problems applied to electricity markets, J. Optim. Theory Appl.208(2026), Article 26. 26 XIAOJUN CHEN, JIAN GUO, AND SEUNGJUN LEE on Pith
  17. [16] Saeed Ghadimi and Warren B. Powell,Stochastic search for a parametric cost function approximation: Energy storage with rolling forecasts, European J. Oper. Res.312(2024), no. 2, 641–652 on Pith
  18. [17] Lanshan Han, Alok Tiwari, M. Kanat Camlibel, and Jong-Shi Pang,Convergence of time-stepping schemes for passive and extended linear complementarity systems, SIAM J. Numer. Anal.47(2009), no. 5, 3768–3796 on Pith
  19. [18] Atsushi Hori and Nobuo Yamashita,Two-stage distributionally robust noncooperative games: existence of Nash equilibrium and its application to Cournot–Nash competition, J. Ind. Manag. Optim.19(2023), no. 9, 6430–6450 on Pith
  20. [19] Menglei Jia, Albert H. Schrotenboer, and Feng Chen,Scenario predict-then-optimize for data-driven online inventory routing, Transportation Sci.59(2025), no. 5, 1032–1056 on Pith
show 21 more
  1. [20] Jie Jiang, Yun Shi, Xiaozhou Wang, and Xiaojun Chen,Regularized two-stage stochastic variational inequalities for Cournot–Nash equilibrium under uncertainty, J. Comput. Math.37(2019), no. 6, 813–842 on Pith
  2. [21] David Kinderlehrer and Guido Stampacchia,An introduction to variational inequalities and their applications, SIAM, 2000 on Pith
  3. [22] Min Li and Chao Zhang,Two-stage stochastic variational inequality arising from stochastic programming, J. Optim. Theory Appl.186(2020), 324–343 on Pith
  4. [23] Min Li, Chao Zhang, Mingxv Ding, and Ruipu Lv,A two-stage stochastic variational inequality model for storage and dynamic distribution of medical supplies in epidemic management, Appl. Math. Model.102(2022), 35–61 on Pith
  5. [24] Jianfeng Luo and Xiaojun Chen,Dynamic systems coupled with solutions of stochastic nonsmooth convex optimization, SIAM J. Control Optim.63(2025), no. 3, 1686–1708 on Pith
  6. [25] Jong-Shi Pang,A posteriori error bounds for the linearly-constrained variational inequality problem, Math. Oper. Res.12(1987), no. 3, 474–484 on Pith
  7. [26] Jong-Shi Pang and David E. Stewart,Differential variational inequalities, Math. Program.113(2008), 345–424 on Pith
  8. [27] R. Tyrrell Rockafellar and Jie Sun,Solving monotone stochastic variational inequalities and complementarity problems by progressive hedging, Math. Program.174(2019), no. 1–2, 453–471 on Pith
  9. [28] R. Tyrrell Rockafellar and Roger J.-B. Wets,Stochastic convex programming: relatively complete recourse and induced feasibility, SIAM J. Control Optim.14(1976), 574–589 on Pith
  10. [29] ,Scenarios and policy aggregation in optimization under uncertainty, Math. Oper. Res.16(1991), no. 1, 119–147 on Pith
  11. [30] ,Stochastic variational inequalities: single-stage to multistage, Math. Program.165(2017), 331–360 on Pith
  12. [31] Alexander Shapiro, Darinka Dentcheva, and Andrzej Ruszczy´ nski,Lectures on stochastic programming: Modeling and theory, SIAM, Philadelphia, 2009 on Pith
  13. [32] Jinglai Shen,Robust non-Zenoness of piecewise affine systems with applications to linear complementarity systems, SIAM J. Optim.24(2014), 2023–2056 on Pith
  14. [33] Jinglai Shen and Jong-Shi Pang,Linear complementarity systems: Zeno states, SIAM J. Control Optim.44 (2005), 1040–1066 on Pith
  15. [34] ,Linear complementarity systems with singleton properties: non-Zenoness, Proceedings of the 2007 American Control Conference, 2007, pp. 2769–2774 on Pith
  16. [35] Hailin Sun and Xiaojun Chen,Two-stage stochastic variational inequalities: theory, algorithms and applications, J. Oper. Res. Soc. China9(2021), 1–32 on Pith
  17. [37] Hailin Sun, Alexander Shapiro, and Xiaojun Chen,Distributionally robust stochastic variational inequalities, Math. Program.200(2023), 279–317 on Pith
  18. [38] Gerald Teschl,Ordinary differential equations and dynamical systems, Graduate Studies in Mathematics, vol. 140, American Mathematical Society, Providence, RI, 2012 on Pith
  19. [39] Roger J.-B. Wets,Stochastic programs with fixed recourse: the equivalent deterministic program, SIAM Rev. 16(1974), 309–339 on Pith
  20. [40] Zhen-Ping Yang, Jin Zhang, Yuliang Wang, and Gui-Hua Lin,Variance-based subgradient extragradient method for stochastic variational inequality problems, J. Sci. Comput.89(2021), Article 4. DISCRETE APPROXIMATION OF DIFFERENTIAL TWO-STAGE SLCP 27 on Pith
  21. [41] Min Zhang, Jie Sun, and Honglei Xu,Two-stage quadratic games under uncertainty and their solution by progressive hedging algorithms, SIAM J. Optim.29(2019), no. 3, 1799–1818. Department of Applied Mathematics, The Hong Kong Polytechnic University, Kowloon, Hong Kong Email addr... on Pith

Challenges and discussion

Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.

No comments yet.

Sign in to comment