Preconditioned Conjugate Gradients in an Interior Point Method for Two-stage Stochastic Programming

Gondzio J (1994). Preconditioned Conjugate Gradients in an Interior Point Method for Two-stage Stochastic Programming. IIASA Working Paper. IIASA, Laxenburg, Austria: WP-94-130

[img]
Preview
Text
WP-94-130.pdf

Download (587kB) | Preview

Abstract

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).

Item Type: Monograph (IIASA Working Paper)
Research Programs: Optimization under Uncertainty (OPT)
Depositing User: IIASA Import
Date Deposited: 15 Jan 2016 02:04
Last Modified: 22 Jul 2016 03:43
URI: http://pure.iiasa.ac.at/4085

Actions (login required)

View Item View Item

International Institute for Applied Systems Analysis (IIASA)
Schlossplatz 1, A-2361 Laxenburg, Austria
Phone: (+43 2236) 807 0 Fax:(+43 2236) 71 313