期刊文献+

基于投影收缩的SA方法求解随机变分不等式问题 被引量:2

Stochastic Approximation Approaches to the Atochastic Variational Inequality Problem Based on Projection and Contraction Method
下载PDF
导出
摘要 求解变分不等式的各种算法中,投影收缩算法易于执行、稳健、而且可以处理大规模问题,因此发展迅速.何炳生教授根据变分不等式及投影算子的性质确定的三个不等式,提出了求解变分不等式的投影收缩算法,此方法简单易行,且便于实现.用随机近似方法来求解随机变分不等式和随机优化问题已经被广泛的研究,其中函数值和一阶导数不可求,但可以用近似的方法得到.将投影收缩算法应用到求解随机变分不等式当中,在一些适当的条件下,可得到全局收敛的结果. Projection and contraction method is an important algorithm for solving variational inequalities. It is easy to implement and robust. It can handle large scale problem. Professor He put forward some projection and contraction methods based on some basic properties of the projection operator. Stochastic approximation methods have been extensively studied in the literature for solving systems of stochastic equations and stochastic optimization problems where function values and first order derivatives are not observable, but can be approximated through simulation. A new algorithm is presented in this paper. The projection and contraction method is applied to stochastic approximation method. Global convergence result of proposed method is obtained under appropriate conditions.
出处 《汕头大学学报(自然科学版)》 2015年第4期71-75,共5页 Journal of Shantou University:Natural Science Edition
基金 国家自然科学基金项目(11171047)
关键词 随机变分不等式 投影收缩算法 随机近似方法 stochastic variational inequalities projection and contraction method stochastic approximation
  • 相关文献

参考文献9

  • 1Gurkan G,Ozge A Y,Robinson S M.Sample path solution of stochastic variational inequalities,with applications to option pricing[C/OL]//Charnes J M,Morrice D M,Brunner D T,et al.Proceedings of the1996 Winter Simulation Conference.[S.l.:s.n.],1996:337-344[2015-03-06].http://www.informs-sim.org/wsc96papers/045.pdf.
  • 2Gurkan G,Ozge A Y,Robinson S M.Sample-path solution of stochastic variational inequalities[J].Mathematical Programming,1999,84(2);313-333.
  • 3Facchinei F,Pang J S.Finite-dimensional variational inequalities and complementarity problems[M].New York:Springer,2003.
  • 4Robinson S M.Analysis of sample-path optimization[J].Mathematics of Operations Research,1996,21(3):513-528.
  • 5Shapiro A.Monte Carlo sampling methods[J].Handbooks in Operations Research and Management Science(Stochastic Programming),2003,10:353-425.DOI:10.1016/S0927-0507(03)10006-0.
  • 6Luo Z Q,Pang J S,Ralph D.Mathematical programs with equilibrium constraints[M].[S.l.]:Cambridge University Press,1996.
  • 7Chen F Y,Yan H,Yao L.A newsvendor pricing game[J].IEEE Transactions on Systems Man&Cybernetics;Part A Systems and Humans,2004,34(4):450-456.DOI:10.1109/TSMCA.2004.826290.
  • 8Mahajan S,van Ryzin G.Inventory competition under dynamic consumer choice[J].Operations Research,2001,49(5):646-657.
  • 9Jiang H Y,Xu H F.Stochastic approximation approaches to the stochastic variational inequality problem[J].IEEE Transactions on Automatic Control,2008,53(6):1462-1475.

同被引文献2

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部