메뉴 건너뛰기




Volumn 64, Issue , 1996, Pages 113-141

A parallel inexact Newton method for stochastic programs with recourse

Author keywords

Inexact newton method; Numerical integration; Parallel quadratic programming; Stochastic programming

Indexed keywords


EID: 21344434512     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/BF02187643     Document Type: Article
Times cited : (14)

References (39)
  • 3
    • 0022698417 scopus 로고
    • Designing approximation schemes for stochastic optimization problems, in particular, for stochastic programs with recourse
    • J.R. Birge and R.J-B Wets, Designing approximation schemes for stochastic optimization problems, in particular, for stochastic programs with recourse, Mathematical Programming Study 27, 1986, 54-102.
    • (1986) Mathematical Programming Study , vol.27 , pp. 54-102
    • Birge, J.R.1    Wets, R.J.-B.2
  • 9
    • 0002983419 scopus 로고
    • Sequential truncated quadratic programming methods
    • P.T. Boggs, R.H. Byrd and R.B. Schnabel, eds., 1984, SIAM, Philadelphia
    • R.S. Dembo and U. Tulowitzki, Sequential truncated quadratic programming methods, in Numerical Optimization, P.T. Boggs, R.H. Byrd and R.B. Schnabel, eds., 1984, SIAM, Philadelphia, 1985, pp. 83-101.
    • (1985) Numerical Optimization , pp. 83-101
    • Dembo, R.S.1    Tulowitzki, U.2
  • 12
    • 0001867697 scopus 로고
    • An inexact NE/SQP method for solving the nonlinear complementarity problem
    • S.A. Gabriel and J.S. Pang, An inexact NE/SQP method for solving the nonlinear complementarity problem, Computational Optimization and Applications 1, 1992, 67-91.
    • (1992) Computational Optimization and Applications , vol.1 , pp. 67-91
    • Gabriel, S.A.1    Pang, J.S.2
  • 13
    • 0016987048 scopus 로고
    • Superlinear convergent quasi-Newton algorithms for nonlinearly constrained optimization problems
    • U.C. Garcia Palomares and O.L. Mangasarian, Superlinear convergent quasi-Newton algorithms for nonlinearly constrained optimization problems, Mathematical Programming 11, 1976, 1-13.
    • (1976) Mathematical Programming , vol.11 , pp. 1-13
    • Garcia Palomares, U.C.1    Mangasarian, O.L.2
  • 14
    • 0000800872 scopus 로고
    • Stochastic decomposition: An algorithm for two-stage linear programs with recourse
    • J.L. Higle and S. Sen, Stochastic decomposition: an algorithm for two-stage linear programs with recourse, Mathematics of Operations Research 16, 1991, 650-669.
    • (1991) Mathematics of Operations Research , vol.16 , pp. 650-669
    • Higle, J.L.1    Sen, S.2
  • 15
    • 34249920356 scopus 로고
    • On the convergence of Han's method for convex programming with quadratic objective
    • A.N. Iusem and A.R. De Pierro, On the convergence of Han's method for convex programming with quadratic objective, Mathematical Programming 52, 1991, 265-284.
    • (1991) Mathematical Programming , vol.52 , pp. 265-284
    • Iusem, A.N.1    De Pierro, A.R.2
  • 16
    • 0026909088 scopus 로고
    • Imbedded lattice rules for multidimensional integration
    • S. Joe and I.H. Sloan, Imbedded lattice rules for multidimensional integration, SIAM Journal on Numerical Analysis 29, 1992, 1119-1135.
    • (1992) SIAM Journal on Numerical Analysis , vol.29 , pp. 1119-1135
    • Joe, S.1    Sloan, I.H.2
  • 17
    • 0027803201 scopus 로고
    • Implementation of a lattice method for numerical multiple integration
    • S. Joe and I. H. Sloan, Implementation of a lattice method for numerical multiple integration, ACM Transactions on Mathematical Software 19, 1993, 523-545.
    • (1993) ACM Transactions on Mathematical Software , vol.19 , pp. 523-545
    • Joe, S.1    Sloan, I.H.2
  • 22
    • 0022792007 scopus 로고
    • Inexact Newton methods for the nonlinear complementarity problem
    • J.S. Pang, Inexact Newton methods for the nonlinear complementarity problem, Mathematical Programming 36, 1986, 54-71.
    • (1986) Mathematical Programming , vol.36 , pp. 54-71
    • Pang, J.S.1
  • 23
    • 0001601094 scopus 로고
    • Newton's method for B-differentiable equations
    • J.S. Pang, Newton's method for B-differentiable equations, Mathematics of Operations Research 15, 1990, 311-341.
    • (1990) Mathematics of Operations Research , vol.15 , pp. 311-341
    • Pang, J.S.1
  • 25
    • 0000607524 scopus 로고
    • Convergence analysis of some algorithms for solving nonsmooth equations
    • L. Qi, Convergence analysis of some algorithms for solving nonsmooth equations, Mathematics of Operations Research 18, 1993, 227-244.
    • (1993) Mathematics of Operations Research , vol.18 , pp. 227-244
    • Qi, L.1
  • 26
    • 23644434856 scopus 로고
    • 1 optimization problems
    • 1 optimization problems, Mathematical Programming 64, 1994, 277-294.
    • (1994) Mathematical Programming , vol.64 , pp. 277-294
    • Qi, L.1
  • 27
    • 0027543961 scopus 로고
    • A nonsmooth version of Newton's method
    • L. Qi and J. Sun, A nonsmooth version of Newton's method, Mathematical Programming 58, 1993, 353-367.
    • (1993) Mathematical Programming , vol.58 , pp. 353-367
    • Qi, L.1    Sun, J.2
  • 28
    • 21844515540 scopus 로고
    • An SQP algorithm for extended linear-quadratic problems in stochastic programming
    • L. Qi and R.S. Womersley, An SQP algorithm for extended linear-quadratic problems in stochastic programming, Annals of Operations Research 56, 1995, 251-285.
    • (1995) Annals of Operations Research , vol.56 , pp. 251-285
    • Qi, L.1    Womersley, R.S.2
  • 29
    • 0004267646 scopus 로고
    • Princeton University Press, Princeton, NJ
    • R. T. Rockafellar, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
    • (1970) Convex Analysis
    • Rockafellar, R.T.1
  • 30
    • 0020929964 scopus 로고
    • A dual solution procedure for quadratic stochastic programs with simple recourse
    • Numerical Methods, V. Pereyra and A. Reinoza, eds., Springer, Berlin
    • R. T. Rockafellar and R.J-B Wets, A dual solution procedure for quadratic stochastic programs with simple recourse, in Numerical Methods, V. Pereyra and A. Reinoza, eds., Lecture Notes in Mathematics 1005, Springer, Berlin, 1983, pp. 252-265.
    • (1983) Lecture Notes in Mathematics , vol.1005 , pp. 252-265
    • Rockafellar, R.T.1    Wets, R.J.-B.2
  • 31
    • 0022699539 scopus 로고
    • A Lagrangian finite-generation technique for solving linear-quadratic problems in stochastic programming
    • R.T. Rockafellar and R.J-B Wets, A Lagrangian finite-generation technique for solving linear-quadratic problems in stochastic programming, Mathematical Programming Study 28, 1986, 63-93.
    • (1986) Mathematical Programming Study , vol.28 , pp. 63-93
    • Rockafellar, R.T.1    Wets, R.J.-B.2
  • 32
    • 0013675612 scopus 로고
    • Linear-quadratic problems with stochastic penalties: The finite generation algorithm
    • Stochastic Optimization, V.I. Arkin, A. Shiraev and R.J-B Wets, eds., Springer, Berlin
    • R.T. Rockafellar and R.J-B Wets, Linear-quadratic problems with stochastic penalties: The finite generation algorithm, in Stochastic Optimization, V.I. Arkin, A. Shiraev and R.J-B Wets, eds., Lecture Notes in Control and Information Sciences 81, Springer, Berlin, 1987, pp. 545-560.
    • (1987) Lecture Notes in Control and Information Sciences , vol.81 , pp. 545-560
    • Rockafellar, R.T.1    Wets, R.J.-B.2
  • 33
    • 0001782846 scopus 로고
    • Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear programming algorithms
    • S.M. Robinson, Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear programming algorithms, Mathematical Programming 7, 1974, 1-16.
    • (1974) Mathematical Programming , vol.7 , pp. 1-16
    • Robinson, S.M.1
  • 34
    • 0000516813 scopus 로고
    • An implicit-function theorem for a class of nonsmooth equations
    • S.M. Robinson, An implicit-function theorem for a class of nonsmooth equations, Mathematics of Operations Research 16, 1991, 292-309.
    • (1991) Mathematics of Operations Research , vol.16 , pp. 292-309
    • Robinson, S.M.1
  • 35
    • 0001060664 scopus 로고
    • Parallel decomposition of multistage stochastic programming problems
    • A. Ruszczynski, Parallel decomposition of multistage stochastic programming problems, Mathematical Programming 58, 1993, 201-228.
    • (1993) Mathematical Programming , vol.58 , pp. 201-228
    • Ruszczynski, A.1
  • 37
    • 0026077016 scopus 로고
    • Applications of a splitting algorithm to decomposition in convex programming and variation inequalities
    • P. Tseng, Applications of a splitting algorithm to decomposition in convex programming and variation inequalities, SIAM Journal on Control and Optimization 29, 1991, 119-138.
    • (1991) SIAM Journal on Control and Optimization , vol.29 , pp. 119-138
    • Tseng, P.1
  • 38
    • 0013206529 scopus 로고
    • A two-stage stochastic facility location problem with time-dependent supply
    • Y. Ermoliev and R.J-B Wets, eds., Springer, Berlin/New York
    • S.W. Wallace, A two-stage stochastic facility location problem with time-dependent supply, in Numerical Techniques for Stochastic Optimization, Y. Ermoliev and R.J-B Wets, eds., Springer, Berlin/New York, 1988, pp. 65-93.
    • (1988) Numerical Techniques for Stochastic Optimization , pp. 65-93
    • Wallace, S.W.1
  • 39
    • 0000712015 scopus 로고
    • Primal-dual projected gradient algorithms for extended linear-quadratic programming
    • C. Zhu and R.T. Rockafellar, Primal-dual projected gradient algorithms for extended linear-quadratic programming, SIAM Journal on Optimization 3, 1993, 751-783.
    • (1993) SIAM Journal on Optimization , vol.3 , pp. 751-783
    • Zhu, C.1    Rockafellar, R.T.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.