Totally relaxed, self-adaptive algorithm for solving variational inequalities over the intersection of sub-level sets. (2nd September 2018)

• Record Type: Journal Article
• Authors: He, Songnian; Wu, Tao; Gibali, Aviv; Dong, Qiao-Li
• Is Part Of: Optimization. Volume 67:Number 9(2018)
• Page Start: 1487
• Page End: 1504
• Publication Date: 2018-09-02
• Subjects: Variational inequalities -- Lipschitz continuous mapping -- level sets -- half-spaces -- convergence rate; Mathematical optimization -- Periodicals; 519.7
• DOI: 10.1080/02331934.2018.1476515
• Languages: English
• ISSNs: 0233-1934

Abstract

Abstract: In this paper we study the classical Variational Inequality (VI) over the intersection of sub-level sets of finite convex functions in real Hilbert spaces. The Subgradient Extragradient method of Censor et al. extend Korpelevich's extragradient method by introducing an additional constructible set and then there is the need to calculate only one orthogonal projection onto the feasible set per each iteration instead of two as in. Motivated by this result, we propose a new extension, called the Totally Relaxed and Self-adaptive Subgradient Extragradient Method, which does not require the calculation of any exact projections onto the VI's feasible set. Hence, any general convex feasible sets can be involved in the VI, such as the finite intersection of sub-level sets of convex functions. In our new scheme we also introduce an adaptive step-size rule which avoids the need to know a priori the Lipschitz constant of the VI associated mapping. Under mild and standard assumptions, we prove weak convergence of the proposed method at rate in the ergodic sense. Two numerical examples are presented to illustrate the behaviour and performances of out proposed scheme.