An SQP algorithm for extended linear-quadratic problems in stochastic programming

Extended Linear-Quadratic Programming (ELQP) problems were introduced by Rockafellar and Wets for various models in stochastic programming and multistage optimization. Several numerical methods with linear convergence rates have been developed for solving fully quadratic ELQP problems, where the primal and dual coefficient matrices are positive definite. We present a two-stage sequential quadratic programming (SQP) method for solving ELQP problems arising in stochastic programming. The first stage algorithm realizes global convergence and the second stage algorithm realizes superlinear local convergence under a condition calledB-regularity.B-regularity is milder than the fully quadratic condition; the primal coefficient matrix need not be positive definite. Numerical tests are given to demonstrate the efficiency of the algorithm. Solution properties of the ELQP problem underB-regularity are also discussed.

[1]  R. Tyrrell Rockafellar,et al.  Computational schemes for large-scale problems in extended linear-quadratic programming , 1990, Math. Program..

[2]  Jong-Shi Pang,et al.  Nonsmooth Equations: Motivation and Algorithms , 1993, SIAM J. Optim..

[3]  R. Wets,et al.  Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse , 1986 .

[4]  Xiaojun Chen,et al.  A parallel inexact newton method for stochastic programs with recourse , 1996, Ann. Oper. Res..

[5]  Alan J. King,et al.  An Implementation of the Lagrangian Finite-Generation Method , 1988 .

[6]  Andrzej Ruszczynski,et al.  A regularized decomposition method for minimizing a sum of polyhedral functions , 1986, Math. Program..

[7]  R. Wets,et al.  Stochastic programming , 1989 .

[8]  Peter Kall,et al.  Approximation Techniques in Stochastic Programming , 1988 .

[9]  R. Rockafellar.  Linear-quadratic programming and optimal control , 1987 .

[10]  Jong-Shi Pang,et al.  Minimization of Locally Lipschitzian Functions , 1991, SIAM J. Optim..

[11]  L. Qi,et al.  Newton's method for quadratic stochastic programs with recourse , 1995 .

[12]  Liqun Qi,et al.  Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations , 1993, Math. Oper. Res..

[13]  Zongli Lin,et al.  Fast Givens goes slow in MATLAB , 1991, SGNM.

[14]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[15]  R. Rockafellar,et al.  A Dual Solution Procedure for Quadratic Stochastic Programs with Simple Recourse , 1983 .

[16]  R. Tyrrell Rockafellar,et al.  Primal-Dual Projected Gradient Algorithms for Extended Linear-Quadratic Programming , 1993, SIAM J. Optim..

[17]  Roger J.-B. Wets,et al.  Stochastic Programming: Solution Techniques and Approximation Schemes , 1982, ISMP.

[18]  Liqun Qi,et al.  Superlinearly convergent approximate Newton methods for LC1 optimization problems , 1994, Math. Program..

[19]  Roger Fletcher,et al.  Practical methods of optimization; (2nd ed.) , 1987 .

[20]  R. Rockafellar,et al.  Generalized linear-quadratic problems of deterministic and stochastic optimal control in discrete time , 1990 .

[21]  R. Rockafellar,et al.  A Lagrangian Finite Generation Technique for Solving Linear-Quadratic Problems in Stochastic Programming , 1986 .