Preconditioned Conjugate Gradients in an Interior Point Method for Two-stage Stochastic Programming
We develop a variant of an interior point method for solving two-stage stochastic linear programming problems. The problems are solved in a deterministic equivalent form in which the first stage variables appear as dense columns. To avoid their degrading influence on the adjacency structure AA^T (and the Cholesky factor) an iterative method is applied to compute orthogonal projections. Conjugate gradient algorithm with a structure-exploiting preconditioner is used. The method has been applied to solve real--life stochastic optimization problems. Preliminary computational results show the feasibility of the approach for problems with up to 80 independent scenarios (a deterministic equivalent linear program has 14001 constraints and 63690 variables).
|Date of creation:||Dec 1994|
|Contact details of provider:|| Postal: A-2361 Laxenburg|
Web page: http://www.iiasa.ac.at/Publications/Catalog/PUB_ONLINE.html
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- John R. Birge & Liqun Qi, 1988. "Computing Block-Angular Karmarkar Projections with Applications to Stochastic Programming," Management Science, INFORMS, vol. 34(12), pages 1472-1479, December.
When requesting a correction, please mention this item's handle: RePEc:wop:iasawp:wp94130. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.