TY - JOUR
T1 - Variance-Based Modified Backward-Forward Algorithm with Line Search for Stochastic Variational Inequality Problems and Its Applications
AU - Yang, Zhen Ping
AU - Wang, Yuliang
AU - Lin, Gui Hua
N1 - Funding Information:
This work was supported in part by NSFC (Nos. 11671250, 11431004 and 71831008), Humanity and Social Science Foundation of Ministry of Education of China (No. 15YJA630034). The authors would like to appreciate two anonymous referees for their helpful suggestions and comments.
PY - 2020/6/1
Y1 - 2020/6/1
N2 - We propose a variance-based modified backward-forward algorithm with a stochastic approximation version of Armijo's line search, which is robust with respect to an unknown Lipschitz constant, for solving a class of stochastic variational inequality problems. A salient feature of the proposed algorithm is to compute only one projection and two independent queries of a stochastic oracle at each iteration. We analyze the proposed algorithm for its asymptotic convergence, sublinear convergence rate in terms of the mean natural residual function, and optimal oracle complexity under moderate conditions. We also discuss the linear convergence rate with finite computational budget for the proposed algorithm without strong monotonicity. Preliminary numerical experiments indicate that the proposed algorithm is competitive with some existing algorithms. Furthermore, we consider an application in dealing with an equilibrium problem in stochastic natural gas trading market.
AB - We propose a variance-based modified backward-forward algorithm with a stochastic approximation version of Armijo's line search, which is robust with respect to an unknown Lipschitz constant, for solving a class of stochastic variational inequality problems. A salient feature of the proposed algorithm is to compute only one projection and two independent queries of a stochastic oracle at each iteration. We analyze the proposed algorithm for its asymptotic convergence, sublinear convergence rate in terms of the mean natural residual function, and optimal oracle complexity under moderate conditions. We also discuss the linear convergence rate with finite computational budget for the proposed algorithm without strong monotonicity. Preliminary numerical experiments indicate that the proposed algorithm is competitive with some existing algorithms. Furthermore, we consider an application in dealing with an equilibrium problem in stochastic natural gas trading market.
KW - linear convergence rate
KW - modified backward-forward algorithm
KW - stochastic approximation
KW - stochastic natural gas trading market
KW - Stochastic variational inequality
UR - http://www.scopus.com/inward/record.url?scp=85084422368&partnerID=8YFLogxK
U2 - 10.1142/S0217595920500116
DO - 10.1142/S0217595920500116
M3 - Journal article
AN - SCOPUS:85084422368
SN - 0217-5959
VL - 37
JO - Asia-Pacific Journal of Operational Research
JF - Asia-Pacific Journal of Operational Research
IS - 3
M1 - 2050011
ER -