Strong convexity in stochastic programs with complete recourse
نویسندگان
چکیده
منابع مشابه
Stochastic Programs with Recourse
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملA heuristic procedure for stochastic integer programs with complete recourse
In this paper, we propose a successive approximation heuristic which solves large stochastic mixed-integer programming problem with complete fixed recourse. We refer to this method as the scenario updating method, since it solves the problem by considering only a subset of scenarios which is updated at each iteration. Only those scenarios which imply a significant change in the objective functi...
متن کاملLipschitz Stability for Stochastic Programs with Complete Recourse
This paper investigates the stability of optimal solution sets to stochastic programs with complete recourse, where the underlying probability measure is understood as a parameter varying in some space of probability measures.piro proved Lipschitz upper semicontinuity of the solution set mapping. Inspired by this result, we introduce a subgradient distance for probability distributions and esta...
متن کاملA Stochastic Newton Method for Stochastic Quadratic Programs with Recourse
In this paper, we combine the inexact Newton method with the stochastic decomposition method and present a stochastic Newton method for solving the two-stage stochastic program. We prove that the new method is superlinearly convergent with probability one and a probabilistic error bound h(N k). The error bound h(N k) at least has the same order as jjy k ?y jj when k ! 1. In the algorithm, we ca...
متن کاملThe Abridged Nested Decomposition Method for Multistage Stochastic Linear Programs with Relatively Complete Recourse
This paper considers large-scale multistage stochastic linear programs. Sampling is incorporated into the nested decomposition algorithm in a manner which proves to be significantly more efficient than a previous approach. The main advantage of the method arises from maintaining a restricted set of solutions that substantially reduces computation time in each stage of the procedure. Dedicated t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1994
ISSN: 0377-0427
DOI: 10.1016/0377-0427(94)90376-x