|Title||An Augmented Incomplete Factorization Approach for Computing the Schur Complement in Stochastic Optimization |
|Publication Type||Journal Article |
|Year of Publication||2014 |
|Authors||Petra, CG, Schenk, O, Lubin, M, Gaertner, K |
|Journal||SIAM Journal on Scientific Comp. |
|Other Numbers||ANL/MCS-P5190-0814 |
|Abstract||We present a scalable approach and implementation for solving stochastic optimization problems on high-performance computers. In this work we revisit the sparse linear algebra computations of the parallel solver PIPS with the goal of improving the shared-memory performance and decreasing the time to solution. These computations consist of solving sparse linear systems with multiple sparse right-hand sides and are needed in our Schur-complement decomposition approach to compute the contribution of each scenario to the Schur matrix. Our novel approach uses an incomplete augmented factorization implemented within the PARDISO linear solver and an outer BiCGStab iteration to efficiently absorb pivot perturbations occurring during factorization. This approach is capable of both efficiently using the cores inside a computational node and exploiting sparsity of the right-hand sides. We report on the performance of the approach on high-performance computers when solving stochastic unit commitment problems of unprecedented size (billions of variables and constraints) that arise in the optimization and control of electrical power grids. Our numerical experiments suggest that supercomputers can be efficiently used to solve power grid stochastic optimization problems with thousands of scenarios under the strict “real-time” requirements of power grid operators. To our knowledge, this has not been possible prior to the present work.