An inexact algorithm with proximal distances for variational inequalities
RAIRO-Oper. Res., 52 1 (2018) 159-176
Published online: 2018-04-23
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Bregman proximal point type algorithms for quasiconvex minimization
F. Lara and R. T. MarcavillacaOptimization 73 (3) 497 (2024)
https://doi.org/10.1080/02331934.2022.2112580
An inexact scalarization proximal point method for multiobjective quasiconvex minimization
E. A. Papa Quiroz and S. CruzadoAnnals of Operations Research 316 (2) 1445 (2022)
https://doi.org/10.1007/s10479-020-03622-8
A parallel subgradient projection algorithm for quasiconvex equilibrium problems under the intersection of convex sets
Le Hai Yen and Le Dung MuuOptimization 71 (15) 4447 (2022)
https://doi.org/10.1080/02331934.2021.1946057
Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in hilbert spaces
Regina S. Burachik, Yaohua Hu and Xiaoqi YangJournal of Global Optimization 83 (2) 249 (2022)
https://doi.org/10.1007/s10898-021-01110-2
Modelling, Computation and Optimization in Information Systems and Management Sciences
Erik Alex Papa QuirozLecture Notes in Networks and Systems, Modelling, Computation and Optimization in Information Systems and Management Sciences 363 3 (2022)
https://doi.org/10.1007/978-3-030-92666-3_1