Scenario Formulation of Stochastic Linear Programs and the Homogeneous Self-Dual Interior-Point Method

References

• Anderson E. D., Anderson K. D., Frenk J. B. G., Roos K., Terlaky T., Zhang S. The MOSEK interior point optimizer for linear programming: An implementation of the homogeneous algorithm. High Performance Optimization Techniques (1999) (Kluwer Academic Publishers, Boston, MA) 197–232Google Scholar
• Anderson E. D., Ye Y. On a homogeneous algorithm for the monotone complementarity problem. Math. Programming (1999) 84:375–400Crossref, Google Scholar
• Berkelaar A., Dert C., Oldenkamp B., Zhang S. A primal-dual decomposition-based interior point approach to two-stage stochastic linear programming. Oper. Res. (2002) 50:904–915Link, Google Scholar
• Berkelaar A., Kouwenberg R., Zhang S. A primal-dual decomposition algorithm for multistage stochastic convex programming. (2000) . Technical report SEEM2000–07, Department of Systems Engineering and Engineering Management, The Chinese University of Hong KongGoogle Scholar
• Birge J. R., Louveaux F.Introduction to Stochastic Programming (1997) (Springer-Verlag, New York) Google Scholar
• Blomvall J., Lindberg P. O. A Riccati-based primal interior point solver for multistage stochastic programming. Eur. J. Oper. Res. (2002) 143:452–461Crossref, Google Scholar
• Chun B. J., Robinson S. M. Scenario analysis via bundle decomposition. Ann. Oper. Res. (1995) 56:39–63Crossref, Google Scholar
• Helgason T., Wallace S. W. Approximate scenario solutions in the progressive hedging algorithm. Ann. Oper. Res. (1991) 31:425–444Crossref, Google Scholar
• Kall P., Wallace S. W.Stochastic Programming (1994) (Wiley, West Sussex, UK) Google Scholar
• King A. J., Ermoliev Y., Wets R. J.-B. Stochastic programming problems: Examples from the literature. Numerical Techniques for Stochastic Optimization (1988) (Springer-Verlag, Berlin, Germany) 543–567Crossref, Google Scholar
• Liu X. W., Sun J. A new decomposition technique in solving multistage stochastic linear programs by infeasible interior point methods. J. Global Optim. (2004) 28:197–215Crossref, Google Scholar
• Lustig I. J., Marsten R. E., Shanno D. F. On implementing Mehrotra’s predictor-corrector interior-point method for linear programming. SIAM J. Optim. (1992) 2:435–449Crossref, Google Scholar
• Mehrotra S. On the implementation of a primal-dual interior point method. SIAM J. Optim. (1992) 2:575–601Crossref, Google Scholar
• Mulvey J. M., Ruszczyński A. A new scenario decomposition method for large-scale stochastic optimization. Oper. Res. (1995) 43:477–490Link, Google Scholar
• Rockafellar R. T., Wets R. J.-B. Scenarios and policy aggregation in optimization under uncertainty. Math. Oper. Res. (1991) 16:119–147Link, Google Scholar
• Ruszczyński A. Decomposition methods in stochastic programming. Math. Programming (1997) 79:333–353Crossref, Google Scholar
• Steinbach M. C., Uryasev S. P., Pardalos P. M. Hierarchical sparsity in multistage convex stochastic programs. Stochastic Optimization: Algorithms and Applications (2001) (Kluwer Academic Publishers, Boston, MA) 385–410Crossref, Google Scholar
• Sun J., Wee K. E., Zhu J. S., Qi L., Womersley R. An interior point method for solving a class of linear-quadratic stochastic programming problems. Recent Advances in Nonsmooth Optimization (1995) (World Scientific Publishing, River Edge, NJ) 392–404Crossref, Google Scholar
• Wright S. J.Primal-Dual Interior-Point Methods (1997) (SIAM, Philadelphia, PA) Crossref, Google Scholar
• Xu X., Hung P., Ye Y. A simplified homogeneous and self-dual linear programming algorithm and its implementation. Ann. Oper. Res. (1996) 62:151–171Crossref, Google Scholar
• Yang D., Zenios S. A. A scalable parallel interior point algorithm for stochastic linear programming and robust optimization. Computational Optim. Appl. (1997) 7:143–158Crossref, Google Scholar
• Ye Y.Interior Point Algorithms, Theory and Analysis (1997) (Wiley, New York) Crossref, Google Scholar
• Ye Y., Todd M. J., Mizuno S. An O(√nL)-iteration homogeneous and self-dual linear programming algorithm. Math. Oper. Res. (1994) 19:53–67Link, Google Scholar
• Zhang Y. Solving large-scale linear programs by interior-point methods under the MATLAB environment. Optim. Methods Software (1998) 10:1–31Crossref, Google Scholar
• Zhao G. Y. A log-barrier method with Benders decomposition for solving two-stage stochastic linear programs. Math. Programming (2001) 90:507–536Crossref, Google Scholar