✦ LIBER ✦

On the Convergence of Sampling-Based Decomposition Algorithms for Multistage Stochastic Programs

✍ Scribed by K. Linowsky; A. B. Philpott

Publisher: Springer
Year: 2005
Tongue: English
Weight: 144 KB
Volume: 125
Category: Article
ISSN: 0022-3239
DOI: 10.1007/s10957-004-1842-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Scalability of Data-Parallel Deco

On the Scalability of Data-Parallel Decomposition Algorithms for Stochastic Programs

✍ R.J. Qi; S.A. Zenios 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 461 KB

On the implementation of a log-barrier p

On the implementation of a log-barrier progressive hedging method for multistage stochastic programs

✍ Xinwei Liu; Kim-Chuan Toh; Gongyun Zhao 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 741 KB

A progressive hedging method incorporated with self-concordant barrier for solving multistage stochastic programs is proposed recently by Zhao [G. Zhao, A Lagrangian dual method with self-concordant barrier for multistage stochastic convex nonlinear programming, Math. Program. 102 (2005) 1-24]. The

On the convergence of a class of outer a

On the convergence of a class of outer approximation algorithms for convex programs

✍ Masao Fukushima 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 719 KB

On the finite convergence of interior-po

On the finite convergence of interior-point algorithms for linear programming

✍ Yinyu Ye 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 631 KB

A note on the convergence of an algorith

A note on the convergence of an algorithm for nonconvex programming problems

✍ Reiner Horst 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 58 KB

An algorithm based on facial decompositi

An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming

✍ Serpil Sayin 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 561 KB