Inertial Algorithms for Solving Nonmonotone Variational Inequality Problems
Bien Thanh Tuyen, Hy Duc Manh and Bui Van Dinh*
Abstract. In this paper, we will construct an inertial algorithm without using the embedded projection method to find a solution of variational inequality problems in which the cost mapping is not required to be atisfied any pseudomonotonicity. The iterative sequences generated by algorithms under the main assumption SM ̸= ∅ are proved that they converge to a solution of the corresponding problems. In addition,numerical experiments are provided to show the effectiveness of the algorithm. (https://viasm.edu.vn/Cms_Data/Contents/viasm/Media/congbo/B-V-Dinh-Inertial-Algorithms-for-Solving-Nonmonotone-Variational-Inequality-Problems.pdf)
Công bố
N.T.V. Hang and M.E. Sarabi: A chain rule for strict twice epi-differentiability and its applications. SIAM J. Optim., 34 (2024), 918—945. Link :https://epubs.siam.org/doi/
N.T.V. Hang, W. Jung, and M.E. Sarabi: Role of subgradients in variational analysis of polyhedral functions. J. Optim. Theory Appl., 200 (2024), 1160—1192. Link: https://link.springer.com/
T. Ashitha, T. Asir, D.T. Hoang, and M.R. Pournaki (2023), Some bounds for the regularity of the edge ideals and their powers in a certain class of graphs, Studia Scientiarum Mathematicarum Hungarica: Combinatorics, Geometry and Topology, No 4, Vol 60, page 237–248 (https://akjournals.com/view/
Le, B.L., Martin, L., Demir, E., Vu, D.M. (2024). A* Search Algorithm for an Optimal Investment Problem in Vehicle-Sharing Systems. In: Hà, M.H., Zhu, X., Thai, M.T. (eds) Computational Data and Social Networks. CSoNet 2023. Lecture Notes in Computer Science, vol 14479. Springer, Singapore. https://doi.org/10.1007/978-981-97-0669-3_16
Vu, D.M., Hewitt, M., Vu, D.D. (2024). Solving Time-Dependent Traveling Salesman Problem with Time Windows Under Generic Time-Dependent Travel Cost. In: Hà, M.H., Zhu, X., Thai, M.T. (eds) Computational Data and Social Networks. CSoNet 2023. Lecture Notes in Computer Science, vol 14479. Springer, Singapore. https://doi.org/10.1007/978-981-97-0669-3_20
Dung TK Ha, Canh V Pham, Tan D Tran. Improved approximation algorithms for-submodular maximization under a knapsack constraint. Computers & Operations Research. Volume 161, January 2024, 106452.(pdf)
Phuong N.H. Pham, Canh V. Pham, Hieu V. Duong, Václav Snášel, Nguyen Trung Thanh. Minimizing cost for influencing target groups in social network: A model and algorithmic approach. Computer Communications, Volume 212, 1 December 2023, Pages 182-197(SCIE-Q1) ( pdf )
Do Trong Hoang, Hop D. Nguyen and Quang Hoa Tran. Asymptotic regularity of invariant chains of edge ideals. Journal of Algebraic Combinatorics , Vol. 59 (2024), pages 55–94 (SCIE), Doi: https://doi.org/10.1007/s10801-023-01284-w
Ho V. N. Phuong and Quang Hoa Tran. A new proof of Stanley's theorem on the strong Lefschetz property. Colloquium Mathematicum, Vol. 173, no. 1 (2023) , 1-8. DOI: 10.4064/cm8987-11-2022