Interior Point Methods in Stochastic Programming

Working Papers are interim reports on work of the International Institute for Applied Systems Analysis and have received only limited review. Views or opinions expressed herein do not necessarily represent those of the Institute or of its National Member Organizations.

[1]  John M. Mulvey,et al.  A diagonal quadratic approximation method for large scale linear programs , 1992, Oper. Res. Lett..

[2]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[3]  John M. Mulvey,et al.  A New Scenario Decomposition Method for Large-Scale Stochastic Optimization , 1995, Oper. Res..

[4]  Tamra Carpenter,et al.  Practical interior point methods for quadratic programming , 1992 .

[5]  A. Ruszczynski.  Augmented Lagrangian Decomposition for Sparse Convex Optimization , 1992 .

[6]  Michael A. Saunders,et al.  On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method , 1986, Math. Program..

[7]  Robert J. Vanderbei,et al.  Prior reduced fill-in in solving equations in interior point algorithms , 1992, Operations Research Letters.

[8]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[9]  Clyde L. Monma,et al.  Further Development of a Primal-Dual Interior Point Method , 1990, INFORMS J. Comput..

[10]  J. Birge,et al.  Computing block-angular Karmarkar projections with applications to stochastic programming , 1988 .

[11]  Yuri Ermoliev,et al.  Numerical techniques for stochastic optimization , 1988 .

[12]  Robert J. Vanderbei,et al.  ALPO: Another Linear Program Optimizer , 1993, INFORMS J. Comput..

[13]  John R. Birge,et al.  Efficient solution of two-stage stochastic linear programs using interior point methods , 1992, Comput. Optim. Appl..

[14]  Andrzej Ruszczyski.  An augmented Lagrangian decomposition method for block diagonal linear programming problems , 1989 .

[15]  Anthony V. Fiacco,et al.  Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .

[16]  John A. Tomlin,et al.  Implementing Interior Point Linear Programming Methods in the Optimization Subroutine Library , 1992, IBM Syst. J..

[17]  S. Mehrotra.  Generalized predictor-corrector methods and their performance , 1991 .

[18]  Renato D. C. Monteiro,et al.  Interior path following primal-dual algorithms. part II: Convex quadratic programming , 1989, Math. Program..

[19]  G. Stephanopoulos,et al.  The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization , 1975 .

[20]  I. Lustig,et al.  Computational experience with a primal-dual interior point method for linear programming , 1991 .

[21]  Roy E. Marsten,et al.  On Implementing Mehrotra's Predictor-Corrector Interior-Point Method for Linear Programming , 1992, SIAM J. Optim..

[22]  R. C. Monteiro,et al.  Interior path following primal-dual algorithms , 1988 .