A preconditioning technique for Schur complement systems arising in stochastic optimization
- First Online:
- 235 Downloads
Deterministic sample average approximations of stochastic programming problems with recourse are suitable for a scenario-based parallelization. In this paper the parallelization is obtained by using an interior-point method and a Schur complement mechanism for the interior-point linear systems. However, the direct linear solves involving the dense Schur complement matrix are expensive, and adversely affect the scalability of this approach. We address this issue by proposing a stochastic preconditioner for the Schur complement matrix and by using Krylov iterative methods for the solution of the dense linear systems. The stochastic preconditioner is built based on a subset of existing scenarios and can be assembled and factorized on a separate process before the computation of the Schur complement matrix finishes on the remaining processes. The expensive factorization of the Schur complement is removed from the parallel execution flow and the scaling of the optimization solver is considerably improved with this approach. The spectral analysis indicates an exponentially fast convergence in probability to 1 of the eigenvalues of the preconditioned matrix with the number of scenarios incorporated in the preconditioner. Numerical experiments performed on the relaxation of a unit commitment problem show good performance, in terms of both the accuracy of the solution and the execution time.
KeywordsStochastic programming Saddle-point preconditioning Krylov methods Interior-point method Sample average approximations Parallel computing
Unable to display preview. Download preview PDF.
- 4.Birge, J.R.: Current trends in stochastic programming computation and applications. Tech. rep., Department of Industrial and Operations Engineering, University of Michigan, Ann Harbour, Michigan (1995) Google Scholar
- 8.Birge, J.R., Chen, X., Qi, L.: A stochastic Newton method for stochastic quadratic programs with recourse. Tech. rep., Applied Mathematics Preprint AM94/9, School of Mathematics, The University of New South Wales (1995) Google Scholar
- 15.Czyzyk, J., Mehrotra, S., Wright, S.J.: PCx user guide. Tech. Rep. OTC 96/01, Optimization Technology Center, Argonne National Laboratory and Northwestern University (1996) Google Scholar
- 16.Dantzig, G.B., Infanger, G.: Large-scale stochastic linear programs—Importance sampling and Benders decomposition. In: Computational and Applied Mathematics, I, pp. 111–120. North-Holland, Amsterdam (1992) Google Scholar
- 24.Gondzio, J., Grothey, A.: Direct solution of linear systems of size 109 arising in optimization with interior point methods. In: PPAM, pp. 513–525 (2005) Google Scholar
- 46.Poulson, J., Marker, B., van de Geijn, R.A.: Elemental: A new framework for distributed memory dense matrix computations (flame working note #44). Tech. Rep., Institute for Computational Engineering and Sciences. The University of Texas at Austin (2010) Google Scholar
- 57.Zhang, Y.: Solving large-scale linear programs by interior-point methods under the Matlab environment. Tech. Rep. TR96-01, University of Maryland Baltimore County (1996) Google Scholar