The University of Southampton
University of Southampton Institutional Repository

An explicit algorithm for solving monotone variational inequalities

An explicit algorithm for solving monotone variational inequalities
An explicit algorithm for solving monotone variational inequalities
In this paper, we are interested in the generalized variational inequality problem in real Hilbert spaces. We propose an explicit proximal method which requires only one proximal step and one mapping evaluation per iteration and also uses an adaptive step-size rule that enables to avoid the prior knowledge of the Lipschitz constant of the involved mapping. Weak convergence of the proposed scheme is established under standard assumptions. Under strong monotonicity, we present the R-linear convergence rate of our new method. Intensive numerical experiments illustrate the advantages and the applicability of our scheme. Moreover, our work generalizes theoretically several recent results in this field.
Gene expression, Linear convergence, Monotonicity, Tomography, Variational inequality, Weak convergence
0168-9274
408-425
Vuong, Phan Tu
52577e5d-ebe9-4a43-b5e7-68aa06cfdcaf
Gibali, Aviv
3dcdb9d0-9155-487f-9438-6a352a1d2b5e
Thong, Dong Viet
bb54bd7f-e240-4ac6-bfaf-709c4347bd74
Vuong, Phan Tu
52577e5d-ebe9-4a43-b5e7-68aa06cfdcaf
Gibali, Aviv
3dcdb9d0-9155-487f-9438-6a352a1d2b5e
Thong, Dong Viet
bb54bd7f-e240-4ac6-bfaf-709c4347bd74

Vuong, Phan Tu, Gibali, Aviv and Thong, Dong Viet (2022) An explicit algorithm for solving monotone variational inequalities. Applied Numerical Mathematics, 171, 408-425. (doi:10.1016/j.apnum.2021.09.013).

Record type: Article

Abstract

In this paper, we are interested in the generalized variational inequality problem in real Hilbert spaces. We propose an explicit proximal method which requires only one proximal step and one mapping evaluation per iteration and also uses an adaptive step-size rule that enables to avoid the prior knowledge of the Lipschitz constant of the involved mapping. Weak convergence of the proposed scheme is established under standard assumptions. Under strong monotonicity, we present the R-linear convergence rate of our new method. Intensive numerical experiments illustrate the advantages and the applicability of our scheme. Moreover, our work generalizes theoretically several recent results in this field.

Text
ThongGibaliVuong_APNUM2022 - Version of Record
Restricted to Repository staff only
Request a copy
Text
ThongGibaliVuong_VIP_APNUM_R_final
Restricted to Repository staff only
Request a copy

More information

Accepted/In Press date: 20 September 2021
e-pub ahead of print date: 23 September 2021
Published date: January 2022
Additional Information: Funding Information: The authors thank Prof. Hedy Attouch, Juan Peypouquet and Yura Malisky for independent fruitful discussions and insights providing while preparing this work. They are grateful to three anonymous referees for their carefully reading and comments, which help to improve the presentation of the paper. This research is funded by National Economics University , Hanoi, Vietnam. Publisher Copyright: © 2021 IMACS
Keywords: Gene expression, Linear convergence, Monotonicity, Tomography, Variational inequality, Weak convergence

Identifiers

Local EPrints ID: 452473
URI: http://eprints.soton.ac.uk/id/eprint/452473
ISSN: 0168-9274
PURE UUID: c6549f5c-e8c9-4aaf-a739-532462f54add
ORCID for Phan Tu Vuong: ORCID iD orcid.org/0000-0002-1474-994X

Catalogue record

Date deposited: 11 Dec 2021 11:07
Last modified: 17 Mar 2024 03:58

Export record

Altmetrics

Contributors

Author: Phan Tu Vuong ORCID iD
Author: Aviv Gibali
Author: Dong Viet Thong

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×