메뉴 건너뛰기




Volumn 139, Issue 2, 2008, Pages 379-392

Feasible semismooth Newton method for a class of stochastic linear complementarity problems

Author keywords

Constrained minimization; Feasible semismooth Newton methods; Stochastic linear complementarity problems

Indexed keywords

NEWTON-RAPHSON METHOD; PROBLEM SOLVING; STOCHASTIC SYSTEMS;

EID: 54049142908     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/s10957-008-9406-2     Document Type: Article
Times cited : (30)

References (18)
  • 1
    • 31144459305 scopus 로고    scopus 로고
    • Expected residual minimization method for stochastic linear complementarity problems
    • X. Chen M. Fukushima 2005 Expected residual minimization method for stochastic linear complementarity problems Math. Oper. Res. 30 1022 1038
    • (2005) Math. Oper. Res. , vol.30 , pp. 1022-1038
    • Chen, X.1    Fukushima, M.2
  • 2
    • 42449152957 scopus 로고    scopus 로고
    • Robust solution of monotone stochastic linear complementarity problems
    • (to appear)
    • Chen, X., Zhang, C., Fukushima, M.: Robust solution of monotone stochastic linear complementarity problems. Math. Prog. (2008, to appear)
    • (2008) Math. Prog.
    • Chen, X.1    Zhang, C.2    Fukushima, M.3
  • 4
    • 33745616495 scopus 로고    scopus 로고
    • New reformulations for stochastic nonlinear complementarity problems
    • G.H. Lin M. Fukushima 2006 New reformulations for stochastic nonlinear complementarity problems Optim. Methods Softw. 21 551 564
    • (2006) Optim. Methods Softw. , vol.21 , pp. 551-564
    • Lin, G.H.1    Fukushima, M.2
  • 5
    • 35148884635 scopus 로고    scopus 로고
    • New restricted NCP functions and their applications to stochastic NCP and stochastic MPEC
    • G.H. Lin X. Chen M. Fukushima 2007 New restricted NCP functions and their applications to stochastic NCP and stochastic MPEC Optimization 56 641 653
    • (2007) Optimization , vol.56 , pp. 641-653
    • Lin, G.H.1    Chen, X.2    Fukushima, M.3
  • 8
    • 2442590125 scopus 로고    scopus 로고
    • A feasible semismooth asymptotically Newton method for mixed complementary problems
    • D. Sun R.S. Womersley H.-D. Qi 2002 A feasible semismooth asymptotically Newton method for mixed complementary problems Math. Prog. 94 167 187
    • (2002) Math. Prog. , vol.94 , pp. 167-187
    • Sun, D.1    Womersley, R.S.2    Qi, H.-D.3
  • 11
    • 0031493529 scopus 로고    scopus 로고
    • Newton and quasi-Newton methods for a class of nonsmooth equations and related problems
    • D. Sun J. Han 1997 Newton and quasi-Newton methods for a class of nonsmooth equations and related problems SIAM J. Optim. 7 463 480
    • (1997) SIAM J. Optim. , vol.7 , pp. 463-480
    • Sun, D.1    Han, J.2
  • 13
    • 84948263182 scopus 로고
    • A special Newton-type optimization method
    • A. Fischer 1992 A special Newton-type optimization method Optimization 24 269 284
    • (1992) Optimization , vol.24 , pp. 269-284
    • Fischer, A.1
  • 14
    • 29244465866 scopus 로고    scopus 로고
    • A penalized Fischer-Burmeister NCP-function
    • B. Chen X. Chen C. Kanzow 2000 A penalized Fischer-Burmeister NCP-function Math. Prog. 88 211 216
    • (2000) Math. Prog. , vol.88 , pp. 211-216
    • Chen, B.1    Chen, X.2    Kanzow, C.3
  • 15
    • 0000554369 scopus 로고    scopus 로고
    • Solution of monotone complementarity problems with locally Lipschitzian functions
    • A. Fischer 1997 Solution of monotone complementarity problems with locally Lipschitzian functions Math. Program. 76 513 532
    • (1997) Math. Program. , vol.76 , pp. 513-532
    • Fischer, A.1
  • 16
    • 0000203179 scopus 로고    scopus 로고
    • Feasible descent algorithms for mixed complementarity problems
    • M.C. Ferris C. Kanzow T.S. Munson 1999 Feasible descent algorithms for mixed complementarity problems Math. Program. 86 475 497
    • (1999) Math. Program. , vol.86 , pp. 475-497
    • Ferris, M.C.1    Kanzow, C.2    Munson, T.S.3
  • 17
    • 0035610337 scopus 로고    scopus 로고
    • Strictly feasible equation-based methods for mixed complementarity problems
    • C. Kanzow 2001 Strictly feasible equation-based methods for mixed complementarity problems Numer. Math. 89 135 160
    • (2001) Numer. Math. , vol.89 , pp. 135-160
    • Kanzow, C.1
  • 18
    • 0000607524 scopus 로고
    • Convergence analysis of some algorithms for solving nonsmooth equations
    • L. Qi 1993 Convergence analysis of some algorithms for solving nonsmooth equations Math. Oper. Res. 18 227 244
    • (1993) Math. Oper. Res. , vol.18 , pp. 227-244
    • Qi, L.1


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