Computational Assessment of Nested Benders and Augmented Lagrangian Decomposition for Mean-Variance Multistage Stochastic Problems

References

• Beale E. M. L. On minimizing a convex function subject to linear inequalities. J. Roy. Statist. Soc. (1955) 17:173–184Google Scholar
• Benders J. F. Partitioning procedures for solving mixed-variables problems. Numerische Mathematik (1962) 4:238–252Crossref, Google Scholar
• Bertsekas D. P.Nonlinear Programming (1999) 2nd ed.(Athena Scientific, Belmont, MA) Google Scholar
• Bertsekas D. P., Tsitsiklis J. N.Parallel, and Distributed Computation (1989) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Birge J. R. Stochastic programming computation and applications. INFORMS J. Comput. (1997) 9:111–133Link, Google Scholar
• Birge J. R., Louveaux F.Introduction to Stochastic Programming (1997) (Springer-Verlag, New York) Google Scholar
• Birge J. R., Rosa C. H. Parallel decomposition of large-scale stochastic nonlinear programs. Ann. Oper. Res. (1996) 64:39–65Crossref, Google Scholar
• Birge J. R., Donohue C. J., Holmes D. F., Svintsitski O. G. A parallel implementation of the nested decomposition algorithm for multistage stochastic linear programs. Math. Programming (1996) 75:327–352Crossref, Google Scholar
• Blomvall J., Lindberg P. A Riccati-based primal interior point solver for multistage stochastic programming. Eur. J. Oper. Res. (2002) 143:452–461Crossref, Google Scholar
• Dantzig G. B. Linear programming under uncertainty. Management Sci. (1955) 1:197–206Link, Google Scholar
• Finance Research Group Watson pension fund management problem. (2000) . Technical report, Judge Institute of Management Studies, Cambridge University, Cambridge, UKGoogle Scholar
• Frauendorfer K. Barycentric scenario trees in convex multistage stochastic programming. Math. Programming (1996) 75:277–293Crossref, Google Scholar
• Gassmann H. MSLIP, a computer code for the multistage stochastic linear programming problem. Math. Programming (1990) 47:407–423Crossref, Google Scholar
• Geoffrion A. M. Generalized Benders decomposition. J. Optim. Theory Appl. (1972) 10:237–260Crossref, Google Scholar
• Gondzio J., Sarkissian R. Column generation with a primal-dual method. (1996) . Logilab Technical Report 96.6, Department of Management Studies, University of Geneva, Geneva, SwitzerlandGoogle Scholar
• Gulpinar N., Rustem B., Settergren R., Nagurney A. Multistage stochastic mean-variance portfolio analysis with transaction costs. Innovations in Financial and Economic Networks (2003) 3(Edward Elgar Publishers Ltd., UK) 46–63Crossref, Google Scholar
• Gulpinar N., Rustem B., Settergren R. Simulation and optimization approaches to scenario tree generation. J. Econom. Dynam. Control (2004) 28:1291–1315Crossref, Google Scholar
• IBM CorporationOptimization Subroutine Library (OSL): Guide and References (1991) . Manual, IBM Corporation, Kingston, NYGoogle Scholar
• Kall P., Wallace S. W.Stochastic Programming (1994) (Wiley, Chichester, UK) Google Scholar
• Lau K., Womersley R. S. Multistage quadratic stochastic programming. J. Comput. Appl. Math. (2001) 129:105–138Crossref, Google Scholar
• Louveaux F. Piecewise convex programs. Math. Programming (1978) 15:53–62Crossref, Google Scholar
• Meszaros C. The BPMPD interior solver for convex quadratic problems. (1999) . Technical report, Department of Computing, Imperial College, London, UKGoogle Scholar
• Mulvey J. M., Ruszczynski A. A diagonal quadratic approximation method for linear multistage stochastic programming problems. System Modeling and Optimization (Zurich, 1991), Lecture Notes in Control and Inform. Sci. (1992) 180(Springer, Berlin, Germany) 588–597Crossref, Google Scholar
• Mulvey J. M., Ruszczynski A. A new scenario decomposition method for large-scale stochastic optimization. Oper. Res. (1995) 43:477–490Link, Google Scholar
• Nielsen S. S., Zenios S. A. Scalable parallel Benders decomposition for stochastic linear programming. Parallel Comput. (1997) 23:1069–1088Crossref, Google Scholar
• Rockafellar T., Wets R. Scenarios and policy aggregation in optimization under uncertainty. Math. Oper. Res. (1991) 16:119–147Link, Google Scholar
• Ruszczynski A. A regularized decomposition method for minimizing a sum of polyhedral functions. Math. Programming (1986) 35:309–333Crossref, Google Scholar
• Ruszczynski A. Parallel decomposition of multistage stochastic programming problems. Math. Programming (1993) 58:201–228Crossref, Google Scholar
• Ruszczynski A. On the regularized decomposition method for stochastic programming problems. Stochastic Programming (Neubiberg/München, 1993), Lecture Notes in Economics and Mathematics Systems (1995) 423(Springer, Berlin, Germany) 93–108Crossref, Google Scholar
• Salinger D. H. T. Rockafellar. Dynamic splitting: An algorithm for deterministic and stochastic multiperiod optimization. Stochastic Programming E-Print Series (SPEPS) (2003) . http://www.speps.info/Google Scholar
• Settergren R. Decomposition of financial engineering problems. (2001) . Technical report, Department of Computing, Imperial College, London, UKGoogle Scholar
• Slyke R. Van, Wets R. J-B. L-shaped linear programs with applications to control and stochastic programming. SIAM J. Appl. Math. (1969) 17:638–663Crossref, Google Scholar
• Steinbach M. C., Kall P., Luthi H. J. Recursive direct algorithms for multistage stochastic programs in financial engineering. Papers Internat. Conf. Oper. Res. (1998) (Springer, New York) 241–250Google Scholar
• Vladimirou H. Computational assessment of distributed decomposition methods for stochastic linear programs. Eur. J. Oper. Res. (1998) 108:653–670Crossref, Google Scholar
• Wittrock R. J. Advances in a nested decomposition algorithm for solving staircase linear programs. (1983) . Technical Report SOL 83-2, Department of Operations Research, Stanford University, Stanford, CAGoogle Scholar