scholarly journals Algorithms for stochastic programs: The case of nonstochastic tenders

Author(s):  
J. L. Nazareth ◽  
R. J.-B. Wets
Keyword(s):  
2003 ◽  
Vol 116 (1) ◽  
pp. 205-228 ◽  
Author(s):  
Z. Wei ◽  
L. Qi ◽  
X. Chen

2017 ◽  
Vol 2017 ◽  
pp. 1-15
Author(s):  
Changyin Zhou ◽  
Rui Su ◽  
Zhihui Jiang

A two-stage stochastic quadratic programming problem with inequality constraints is considered. By quasi-Monte-Carlo-based approximations of the objective function and its first derivative, a feasible sequential system of linear equations method is proposed. A new technique to update the active constraint set is suggested. We show that the sequence generated by the proposed algorithm converges globally to a Karush-Kuhn-Tucker (KKT) point of the problem. In particular, the convergence rate is locally superlinear under some additional conditions.


2013 ◽  
Vol 50 (02) ◽  
pp. 533-541 ◽  
Author(s):  
Alexander Shapiro

In this paper we study asymptotic consistency of law invariant convex risk measures and the corresponding risk averse stochastic programming problems for independent, identically distributed data. Under mild regularity conditions, we prove a law of large numbers and epiconvergence of the corresponding statistical estimators. This can be applied in a straightforward way to establish convergence with probability 1 of sample-based estimators of risk averse stochastic programming problems.


1968 ◽  
Vol 2 (3) ◽  
pp. 305-311 ◽  
Author(s):  
David W. Walkup ◽  
Roger J.-B. Wets

1984 ◽  
Vol 33 (1) ◽  
pp. 109-116
Author(s):  
Raymond Nadeau ◽  
Radu Theodorescu
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document