Indexed by:
Abstract:
Recently, some proximal-based alternating direction methods and alternating projection-based prediction-correction methods were proposed to solve the structured variational inequalities in Euclidean space . We note that the proximal-based alternating direction methods need to solve its subproblems exactly. However, the subproblems of the proximal-based alternating direction methods are too difficult to be solved exactly in many practical applications. We also note that the existing alternating projection based prediction-correction methods just can cope with the case that the underlying mappings are Lipschitz continuous. However, it could be difficult to verify their Lipschitz continuity condition, provided that the available information is only the mapping values. In this paper, we present a new alternating projection-based prediction-correction method for solving the structured variational inequalities, where the underlying mappings are continuous. In each iteration, we first employ a new Armijo linesearch to derive the predictors, and then update the next iterate via some minor computations. Under some mild assumptions, we establish the global convergence theorem of the proposed method. Preliminary numerical results are also reported to illustrate the effectiveness of the proposed method.
Keyword:
Reprint Author's Address:
Email:
Source :
OPTIMIZATION METHODS & SOFTWARE
ISSN: 1055-6788
Year: 2019
Issue: 4
Volume: 34
Page: 707-730
2 . 2 0 0
JCR@2022
ESI Discipline: COMPUTER SCIENCE;
ESI HC Threshold:147
JCR Journal Grade:2
Cited Count:
WoS CC Cited Count: 2
SCOPUS Cited Count: 2
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 9
Affiliated Colleges: