A regularized decomposition method for minimizing a sum of polyhedral functions
Mathematical Programming: Series A and B
Scenarios and policy aggregation in optimization under uncertainty
Mathematics of Operations Research
Stochastic decomposition: an algorithm for two-state linear programs with recourse
Mathematics of Operations Research
Existence of interior points and interior paths in nonlinear monotone complementarity problems
Mathematics of Operations Research
Matrix computations (3rd ed.)
Properties of an interior-point mapping for mixed complementarity problems
Mathematics of Operations Research
Iterative methods for solving linear systems
Iterative methods for solving linear systems
Primal-dual interior-point methods
Primal-dual interior-point methods
ScaLAPACK user's guide
Constraint Preconditioning for Indefinite Linear Systems
SIAM Journal on Matrix Analysis and Applications
A Note on Preconditioning for Indefinite Linear Systems
SIAM Journal on Scientific Computing
On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization
SIAM Journal on Scientific Computing
A Specialized Interior-Point Algorithm for Multicommodity Network Flows
SIAM Journal on Optimization
Decomposition Algorithms for Stochastic Programming on a Computational Grid
Computational Optimization and Applications
Computational Optimization and Applications
Object-oriented software for quadratic programming
ACM Transactions on Mathematical Software (TOMS)
Preconditioning Indefinite Systems in Interior Point Methods for Optimization
Computational Optimization and Applications
Approximate Factorization Constraint Preconditioners for Saddle-Point Matrices
SIAM Journal on Scientific Computing
Implicit-Factorization Preconditioning and Iterative Solvers for Regularized Saddle-Point Systems
SIAM Journal on Matrix Analysis and Applications
Decomposition-Based Interior Point Methods for Two-Stage Stochastic Semidefinite Programming
SIAM Journal on Optimization
SIAM Journal on Optimization
Computational Optimization and Applications
Introduction to Stochastic Programming
Introduction to Stochastic Programming
Direct solution of linear systems of size 109 arising in optimization with interior point methods
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Turbine: A Distributed-memory Dataflow Engine for High Performance Many-task Applications
Fundamenta Informaticae - Scalable Workflow Enactment Engines and Technology
| Hi-index | 0.00 |
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.