Convergence Analysis of a Stochastic Progressive Hedging Algorithm for Stochastic Programming
نویسندگان
چکیده
منابع مشابه
Sampling based progressive hedging algorithms for stochastic programming problems
...............................................................................................138 Autobiographical Statement ................................................................................ 140
متن کاملSampling-Based Progressive Hedging Algorithms in Two-Stage Stochastic Programming
Abstract Most real-world optimization problems are subject to uncertainties in parameters. In many situations where the uncertainties can be estimated to a certain degree, various stochastic programming (SP) methodologies are used to identify robust plans. Despite substantial advances in SP, it is still a challenge to solve practical SP problems, partially due to the exponentially increasing nu...
متن کاملOptimal scenario set partitioning for multistage stochastic programming with the progressive hedging algorithm
In this paper, we propose a new approach to reduce the total running time (RT) of the progressive hedging algorithm (PHA) for solving multistage stochastic programs (MSPs) defined on a scenario tree. Instead of using the conventional scenario decomposition scheme, we apply a multi-scenario decomposition scheme and partition the scenario set in order to minimize the number of non-anticipativity ...
متن کاملA Progressive Hedging Based Branch-and-Bound Algorithm for Stochastic Mixed-Integer Programs
Progressive Hedging (PH) is a well-known algorithm for solving multi-stage stochastic convex optimization problems. Most previous extensions of PH for stochastic mixed-integer programs have been implemented without convergence guarantees. In this paper, we present a new framework that shows how PH can be utilized while guaranteeing convergence to globally optimal solutions of stochastic mixed-i...
متن کاملProgressive hedging-based metaheuristics for stochastic network design
We consider the stochastic variant of the fixed-charge capacitated multicommodity network design (CMND) problem in which demands are stochastic. We propose a two-stage stochastic programming formulation where design decisions make up the first stage, while a series of recourse decisions are made in the second stage to distribute the commodities according to observed demands. The overall objecti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics, Optimization & Information Computing
سال: 2020
ISSN: 2310-5070,2311-004X
DOI: 10.19139/soic-2310-5070-964