✦ LIBER ✦

A Primal-Dual Decomposition Algorithm for Multistage Stochastic Convex Programming

✍ Scribed by Arjan Berkelaar; Joaquim A. S. Gromicho; Roy Kouwenberg; Shuzhong Zhang

Publisher: Springer-Verlag
Year: 2005
Tongue: English
Weight: 388 KB
Volume: 104
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-005-0575-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A primal-dual trust-region algorithm for

A primal-dual trust-region algorithm for non-convex nonlinear programming

✍ Andrew R. Conn; Nicholas I. M. Gould; Dominique Orban; Philippe L. Toint 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 293 KB

Primal-dual proximal point algorithm for

Primal-dual proximal point algorithm for linearly constrained convex programming problems

✍ Satoru Ibaraki; Masao Fukushima; Toshihide Ibaraki 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 964 KB

A class of convergent primal-dual subgra

A class of convergent primal-dual subgradient algorithms for decomposable convex programs

✍ S. Sen; Hanif D. Sherali 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 986 KB

A primal-dual interior-point algorithm f

A primal-dual interior-point algorithm for quadratic programming

✍ Juan Dominguez; María D. González-Lima 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 598 KB

A multistage stochastic programming algo

A multistage stochastic programming algorithm suitable for parallel computing

✍ Jörgen Blomvall 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 187 KB

In [Euro. J. Operat. Res. 143 (2002) 452; Opt. Meth. Software 17 (2002) 383] a Riccatibased primal interior point method for multistage stochastic programmes was developed. This algorithm has several interesting features. It can solve problems with a nonlinear node-separable convex objective, local

On the Convergence of Sampling-Based Dec

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

✍ K. Linowsky; A. B. Philpott 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 144 KB