106
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

A simple fork algorithm for solving pseudomonotone non-Lipschitz variational inequalities

Pages 1807-1820 | Received 25 Apr 2020, Accepted 14 Oct 2020, Published online: 19 Nov 2020
 

Abstract

We introduce a new algorithm, improved from the Armijo line search one [M.V. Solodov and B.F. Svaiter, A new projection method for monotone variational inequality problems, SIAM J. Control Optim. 37 (1999), pp. 765–776]. Our algorithm converges under the same assumption but does not use the line search procedure in its steps. Our numerical experiments show that the new algorithm is more effective than some existing ones.

2010 AMS Subject Classifications:

Acknowledgments

The author would like to thank the anonymous referees for their remarks which helped to significantly improve the paper. This work was supported by Vietnam Ministry of Education and Training under grant number B2020-BKA-21-CTTH.

Disclosure statement

No potential conflict of interest was reported by the author(s).

Additional information

Funding

This work was supported by Vietnam Ministry of Education and Training [grant number B2020-BKA-21-CTTH].

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.