A parallel inexact newton method for stochastic programs with recourse
暂无分享,去创建一个
[1] R. Wets,et al. Stochastic programming , 1989 .
[2] Dimitri P. Bertsekas,et al. Constrained Optimization and Lagrange Multiplier Methods , 1982 .
[3] Roger J.-B. Wets,et al. Stochastic programming, an Introduction , 1988 .
[4] Liqun Qi,et al. A nonsmooth version of Newton's method , 1993, Math. Program..
[5] I. Sloan,et al. Imbedded lattice rules for multidimensional integration , 1992 .
[6] Alvaro R. De Pierro,et al. On the convergence of Han's method for convex programming with quadratic objective , 1991, Math. Program..
[7] R. Dembo,et al. INEXACT NEWTON METHODS , 1982 .
[8] Stephen Joe,et al. Implementation of a lattice method for numerical multiple integration , 1993, TOMS.
[9] L. Qi,et al. Newton's method for quadratic stochastic programs with recourse , 1995 .
[10] I. Sloan. Lattice Methods for Multiple Integration , 1994 .
[11] Liqun Qi,et al. An SQP algorithm for extended linear-quadratic problems in stochastic programming , 1995, Ann. Oper. Res..
[12] John N. Tsitsiklis,et al. Parallel and distributed computation , 1989 .
[13] R. Rockafellar,et al. A Dual Solution Procedure for Quadratic Stochastic Programs with Simple Recourse , 1983 .
[14] R. Rockafellar,et al. A Lagrangian Finite Generation Technique for Solving Linear-Quadratic Problems in Stochastic Programming , 1986 .
[15] Stephen M. Robinson,et al. Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms , 1974, Math. Program..
[16] L. Qi,et al. A Stochastic Newton Method for Stochastic Quadratic Programs with Recourse , 1995 .
[17] R. Tyrrell Rockafellar,et al. Primal-Dual Projected Gradient Algorithms for Extended Linear-Quadratic Programming , 1993, SIAM J. Optim..
[18] J. Pang,et al. A globally convergent Newton method for convex SC1 minimization problems , 1995 .
[19] Jong-Shi Pang,et al. Inexact Newton methods for the nonlinear complementarity problem , 1986, Math. Program..
[20] Liqun Qi,et al. Superlinearly convergent approximate Newton methods for LC1 optimization problems , 1994, Math. Program..
[21] Harald Niederreiter,et al. Random number generation and Quasi-Monte Carlo methods , 1992, CBMS-NSF regional conference series in applied mathematics.
[22] G. R. Walsh,et al. Methods Of Optimization , 1976 .
[23] Liqun Qi,et al. Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations , 1993, Math. Oper. Res..
[24] Stephen M. Robinson,et al. An Implicit-Function Theorem for a Class of Nonsmooth Functions , 1991, Math. Oper. Res..
[25] Julia L. Higle,et al. Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse , 1991, Math. Oper. Res..
[26] Philip Rabinowitz,et al. Methods of Numerical Integration , 1985 .
[27] M C Ferris,et al. Parallel Constraint Distribution , 1991, SIAM J. Optim..
[28] F. Clarke. Optimization And Nonsmooth Analysis , 1983 .
[29] P. Tseng. Applications of splitting algorithm to decomposition in convex programming and variational inequalities , 1991 .
[30] Roger J.-B. Wets,et al. Probabilistic bounds (via large deviations) for the solutions of stochastic programming problems , 1995, Ann. Oper. Res..
[31] R. Fletcher. Practical Methods of Optimization , 1988 .
[32] R. Wets,et al. Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse , 1986 .
[33] Stein W. Wallace. A Two-Stage Stochastic Facility-Location Problem with Time-Dependent Supply , 1988 .
[34] Jong-Shi Pang,et al. Newton's Method for B-Differentiable Equations , 1990, Math. Oper. Res..
[35] Olvi L. Mangasarian,et al. Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems , 1976, Math. Program..
[36] 丸山 徹. Convex Analysisの二,三の進展について , 1977 .
[37] Jong-Shi Pang,et al. An inexact NE/SQP method for solving the nonlinear complementarity problem , 1992, Comput. Optim. Appl..
[38] Andrzej Ruszczynski,et al. Parallel decomposition of multistage stochastic programming problems , 1993, Math. Program..