var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https://bingtan.me/scopus.bib&jsonp=1&group0=year&groupby=author_short&folding=1&nocache=1&authorFirst=1&noTitleLinks=true&theme=default&showSearch=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https://bingtan.me/scopus.bib&jsonp=1&group0=year&groupby=author_short&folding=1&nocache=1&authorFirst=1&noTitleLinks=true&theme=default&showSearch=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https://bingtan.me/scopus.bib&jsonp=1&group0=year&groupby=author_short&folding=1&nocache=1&authorFirst=1&noTitleLinks=true&theme=default&showSearch=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n Cai, G.\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n Xie, Z.; Cai, G.; and Tan, B.\n\n\n \n \n \n Inertial subgradient extragradient method for solving pseudomonotone equilibrium probelms and fixed point problems in Hilbert spaces.\n \n \n\n\n \n\n\n\n Optimization, 73(5): 1329-1354. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{XCT_OPT24,\nauthor={Xie, Zhongbing and Cai, Gang and Tan, Bing},\ntitle={Inertial subgradient extragradient method for solving pseudomonotone equilibrium probelms and fixed point problems in Hilbert spaces},\njournal={Optimization},\nyear={2024},\nvolume={73},\nnumber={5},\npages={1329-1354},\ndoi={10.1080/02331934.2022.2157677},\nurl={https://bingtan.me/files/paper/XCT-OPT2024.pdf},\nabstract={This paper proposes a new inertial subgradient extragradient method for solving equilibrium problems with pseudomonotone and Lipschitz-type bifunctions and fixed point problems for nonexpansive mappings in real Hilbert spaces. Precisely, we prove that the sequence generated by proposed algorithm converges strongly to a common solution of equilibrium problems and fixed point problems. We use an effective self-adaptive step size rule to accelerate the convergence process of our proposed iterative algorithm. Moreover, some numerical results are given to show the effectiveness of the proposed algorithm. The results obtained in this paper extend and improve many recent ones in the literature.},\nkeywords={Inertial method,  Subgradient extragradient method, Equilibrium probelm, Fixed point problem, Strong convergence},\nabbrev_source_title={Optimization},\n}\n\n
\n
\n\n\n
\n This paper proposes a new inertial subgradient extragradient method for solving equilibrium problems with pseudomonotone and Lipschitz-type bifunctions and fixed point problems for nonexpansive mappings in real Hilbert spaces. Precisely, we prove that the sequence generated by proposed algorithm converges strongly to a common solution of equilibrium problems and fixed point problems. We use an effective self-adaptive step size rule to accelerate the convergence process of our proposed iterative algorithm. Moreover, some numerical results are given to show the effectiveness of the proposed algorithm. The results obtained in this paper extend and improve many recent ones in the literature.\n
\n\n\n
\n\n\n
\n \n\n \n \n Zhou, X.; Cai, G.; Tan, B.; and Dong, Q. L.\n\n\n \n \n \n A modified generalized version of projected reflected gradient method in Hilbert spaces.\n \n \n\n\n \n\n\n\n Numerical Algorithms, doi:10.1007/s11075-023-01566-1. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{ZCTD_NUMA23,\nauthor={Zhou, Xiaolin and Cai, Gang and Tan, Bing and Dong, Qiao L.},\ntitle={A modified generalized version of projected reflected gradient method in Hilbert spaces},\njournal={Numerical Algorithms},\nyear={2023},\nvolume={doi:10.1007/s11075-023-01566-1},\ndoi={10.1007/s11075-023-01566-1},\nurl={https://bingtan.me/files/paper/ZCTD-NUMA2023.pdf},\nabstract={This article is concerned with a universal version of projected reflected gradient method with new step size for solving variational inequality problem in Hilbert spaces. Under appropriate assumptions controlled by the operators and parameters, we acquire the weak convergence of the proposed algorithm. We establish an R-linear convergence rate of our method on the condition that the relevant mapping is strongly monotone. We rework our first algorithm so that it can be simplified to several generalized methods in the literature. The efficacy and availability of our proposed iterative scheme are demonstrated in numerical experiments.},\nkeywords={Projected reflected gradient method, Variational inequality, Weak and linear convergence, Hilbert spaces},\nabbrev_source_title={Numer. Algorithms},\n}\n\n
\n
\n\n\n
\n This article is concerned with a universal version of projected reflected gradient method with new step size for solving variational inequality problem in Hilbert spaces. Under appropriate assumptions controlled by the operators and parameters, we acquire the weak convergence of the proposed algorithm. We establish an R-linear convergence rate of our method on the condition that the relevant mapping is strongly monotone. We rework our first algorithm so that it can be simplified to several generalized methods in the literature. The efficacy and availability of our proposed iterative scheme are demonstrated in numerical experiments.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n Cho, S.\n \n \n (14)\n \n \n
\n
\n \n \n
\n \n\n \n \n Tan, B.; Li, S.; and Cho, S. Y.\n\n\n \n \n \n Inertial projection and contraction methods for pseudomonotone variational inequalities with non-Lipschitz operators and applications.\n \n \n\n\n \n\n\n\n Applicable Analysis, 102(4): 1199–1221. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TLC_AA23,\nauthor={Tan, Bing and Li, Songxiao and Cho, Sun Y.},\ntitle={Inertial projection and contraction methods for pseudomonotone variational inequalities with non-Lipschitz operators and applications},\njournal={Applicable Analysis},\nyear={2023},\nvolume={102},\nnumber={4},\ndoi={10.1080/00036811.2021.1979219},\npages={1199--1221},\nurl={https://bingtan.me/files/paper/TLC-AA2023.pdf},\nabstract={In this paper, some new accelerated iterative schemes are proposed to solve the variational inequality problem with a pseudomonotone and uniformly continuous operator in real Hilbert spaces. Strong convergence theorems of the suggested algorithms are obtained without the prior knowledge of the Lipschitz constant of the operator. Some numerical experiments and applications are performed to illustrate the advantages of the proposed methods with respect to several related ones.},\nkeywords={Inertial extragradient method,  Projection and contraction method,  Pseudomonotone operator,  Non-Lipschitz operator,  Variational inequality problem},\nabbrev_source_title={Appl. Anal.},\n}\n\n
\n
\n\n\n
\n In this paper, some new accelerated iterative schemes are proposed to solve the variational inequality problem with a pseudomonotone and uniformly continuous operator in real Hilbert spaces. Strong convergence theorems of the suggested algorithms are obtained without the prior knowledge of the Lipschitz constant of the operator. Some numerical experiments and applications are performed to illustrate the advantages of the proposed methods with respect to several related ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Qin, X.; and Cho, S. Y.\n\n\n \n \n \n Revisiting subgradient extragradient methods for solving variational inequalities.\n \n \n\n\n \n\n\n\n Numerical Algorithms, 90(4): 1593–1615. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"RevisitingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TQC_NUMA22,\nauthor={Tan, Bing and Qin, Xiaolong and Cho, Sun Y.},\ntitle={Revisiting subgradient extragradient methods for solving variational inequalities},\njournal={Numerical Algorithms},\nyear={2022},\nvolume={90},\nnumber={4},\npages={1593--1615},\ndoi={10.1007/s11075-021-01243-1},\nurl={https://bingtan.me/files/paper/TQC-NUMA2022.pdf},\nabstract={In this paper, several extragradient algorithms with inertial effects and adaptive non-monotonic step sizes are proposed to solve pseudomonotone variational inequalities in real Hilbert spaces. The strong convergence of the proposed methods is established without the prior knowledge of the Lipschitz constant of the mapping. Some numerical experiments are given to illustrate the advantages and efficiency of the proposed schemes over previously known ones.},\nkeywords={Armijo stepsize,  Inertial extragradient method,  Non-Lipschitz operator,  Pseudomonotone operator,  Variational inequality problem},\nabbrev_source_title={Numer. Algorithms},\n}\n\n
\n
\n\n\n
\n In this paper, several extragradient algorithms with inertial effects and adaptive non-monotonic step sizes are proposed to solve pseudomonotone variational inequalities in real Hilbert spaces. The strong convergence of the proposed methods is established without the prior knowledge of the Lipschitz constant of the mapping. Some numerical experiments are given to illustrate the advantages and efficiency of the proposed schemes over previously known ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Li, S.; and Cho, S. Y.\n\n\n \n \n \n Revisiting inertial subgradient extragradient algorithms for solving bilevel variational inequality problems.\n \n \n\n\n \n\n\n\n Journal of Applied and Numerical Optimization, 4(3): 425–444. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"RevisitingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TLC_JANO22,\nauthor={Tan, Bing and Li, Songxiao and Cho, Sun Y.},\ntitle={Revisiting inertial subgradient extragradient algorithms for solving bilevel variational inequality problems},\njournal={Journal of Applied and Numerical Optimization},\nyear={2022},\nvolume={4},\nnumber={3},\npages={425--444},\ndoi={10.23952/jano.4.2022.3.08},\nurl={https://bingtan.me/files/paper/TLC-JANO2022.pdf},\nabstract={In this paper, four modified subgradient extragradient algorithms are proposed for solving bilevel pseudomonotone variational inequality problems in real Hilbert spaces. The proposed algorithms can work adaptively without the prior knowledge of the Lipschitz constant of the pseudomonotone mapping. Strong convergence theorems for the suggested algorithms are established under suitable and mild conditions. Finally, some numerical experiments and applications are performed to verify the efficiency of the proposed algorithms with respect to some previously known ones.},\nkeywords={Inertial method, Pseudomonotone operator, Subgradient extragradient method, Bilevel variational inequality problem},\nabbrev_source_title={J. Appl. Numer. Optim.},\n}\n\n
\n
\n\n\n
\n In this paper, four modified subgradient extragradient algorithms are proposed for solving bilevel pseudomonotone variational inequality problems in real Hilbert spaces. The proposed algorithms can work adaptively without the prior knowledge of the Lipschitz constant of the pseudomonotone mapping. Strong convergence theorems for the suggested algorithms are established under suitable and mild conditions. Finally, some numerical experiments and applications are performed to verify the efficiency of the proposed algorithms with respect to some previously known ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Cho, S. Y.; and Yao, J. C.\n\n\n \n \n \n Accelerated inertial subgradient extragradient algorithms with non-monotonic step sizes for equilibrium problems and fixed point problems.\n \n \n\n\n \n\n\n\n Journal of Nonlinear and Variational Analysis, 6(1): 89–122. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"AcceleratedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TCY_JNVA22,\nauthor={Tan, Bing and Cho, Sun Y. and Yao, Jen C.},\ntitle={Accelerated inertial subgradient extragradient algorithms with non-monotonic step sizes for equilibrium problems and fixed point problems},\njournal={Journal of Nonlinear and Variational Analysis},\nyear={2022},\nvolume={6},\nnumber={1},\npages={89--122},\ndoi={10.23952/jnva.6.2022.1.06},\nurl={https://bingtan.me/files/paper/TCY-JNVA2022.pdf},\nabstract={This paper introduces several new accelerated subgradient extragradient methods with inertial effects for approximating a solution of a pseudomonotone equilibrium problem and a fixed point problem involving a quasi-nonexpansive mapping or a demicontractive mapping in real Hilbert spaces. The proposed algorithms use an adaptive non-monotonic step size criterion that does not include any Armijo line search process. Strong convergence theorems of the suggested iterative algorithms are established without the prior knowledge of the Lipschitz constants of the bifunction. Moreover, $R$-linear convergence is guaranteed under the assumption that the bifunction satisfies strong pseudomonotonicity. Applications to variational inequality problems are also considered. Finally, some numerical examples and applications, which demonstrate the advantages and efficiency of the proposed algorithms, are given.},\nkeywords={Equilibrium problem,  Fixed point problem,  Inertial method,  Pseudomonotone bifunction,  Subgradient extragradient method},\nabbrev_source_title={J. Nonlinear Var. Anal.},\n}\n\n
\n
\n\n\n
\n This paper introduces several new accelerated subgradient extragradient methods with inertial effects for approximating a solution of a pseudomonotone equilibrium problem and a fixed point problem involving a quasi-nonexpansive mapping or a demicontractive mapping in real Hilbert spaces. The proposed algorithms use an adaptive non-monotonic step size criterion that does not include any Armijo line search process. Strong convergence theorems of the suggested iterative algorithms are established without the prior knowledge of the Lipschitz constants of the bifunction. Moreover, $R$-linear convergence is guaranteed under the assumption that the bifunction satisfies strong pseudomonotonicity. Applications to variational inequality problems are also considered. Finally, some numerical examples and applications, which demonstrate the advantages and efficiency of the proposed algorithms, are given.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Cho, S. Y.\n\n\n \n \n \n Two adaptive modified subgradient extragradient methods for bilevel pseudomonotone variational inequalities with applications.\n \n \n\n\n \n\n\n\n Communications in Nonlinear Science and Numerical Simulation, 107: 106160. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"TwoPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TC_CNSNS22,\nauthor={Tan, Bing and Cho, Sun Y.},\ntitle={Two adaptive modified subgradient extragradient methods for bilevel pseudomonotone variational inequalities with applications},\njournal={Communications in Nonlinear Science and Numerical Simulation},\nyear={2022},\nvolume={107},\ndoi={10.1016/j.cnsns.2021.106160},\npages={106160},\nurl={https://bingtan.me/files/paper/TC-CNSNS2022.pdf},\nabstract={We consider the bilevel variational inequality problem with a pseudomonotone operator in real Hilbert spaces and investigate two modified subgradient extragradient methods with inertial terms. Our first scheme requires the operator to be Lipschitz continuous (the Lipschitz constant does not need to be known) while the second one only requires it to be uniformly continuous. The proposed methods employ two adaptive stepsizes making them work without the prior knowledge of the Lipschitz constant of the mapping. The strong convergence properties of the iterative sequences generated by the proposed algorithms are obtained under mild conditions. Some numerical tests and applications are given to demonstrate the advantages and efficiency of the stated schemes over previously known ones.},\nkeywords={Adaptive stepsize,  Bilevel variational inequality problem,  Extragradient method,  Inertial method,  Pseudomonotone operator},\nabbrev_source_title={Comm. Nonlinear Sci. Numer. Simul.},\n}\n\n
\n
\n\n\n
\n We consider the bilevel variational inequality problem with a pseudomonotone operator in real Hilbert spaces and investigate two modified subgradient extragradient methods with inertial terms. Our first scheme requires the operator to be Lipschitz continuous (the Lipschitz constant does not need to be known) while the second one only requires it to be uniformly continuous. The proposed methods employ two adaptive stepsizes making them work without the prior knowledge of the Lipschitz constant of the mapping. The strong convergence properties of the iterative sequences generated by the proposed algorithms are obtained under mild conditions. Some numerical tests and applications are given to demonstrate the advantages and efficiency of the stated schemes over previously known ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Cho, S. Y.\n\n\n \n \n \n Two projection-based methods for bilevel pseudomonotone variational inequalities involving non-Lipschitz operators.\n \n \n\n\n \n\n\n\n Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas, 116(2): 64. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"TwoPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TC_RCSM22,\nauthor={Tan, Bing and Cho, Sun Y.},\ntitle={Two projection-based methods for bilevel pseudomonotone variational inequalities involving non-Lipschitz operators},\njournal={Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas},\nyear={2022},\nvolume={116},\nnumber={2},\ndoi={10.1007/s13398-021-01205-1},\npages={64},\nurl={https://bingtan.me/files/paper/TC-RACSAM2022.pdf},\nabstract={In this paper, we propose two new iterative algorithms to discover solutions of bilevel pseudomonotone variational inequalities with non-Lipschitz continuous operators in real Hilbert spaces. Our proposed algorithms need to compute the projection on the feasible set only once in each iteration although they employ Armijo line search methods. Strong convergence theorems of the suggested algorithms are established under suitable and weaker conditions. Some numerical experiments and applications are given to demonstrate the performance of the offered algorithms compared to some known ones.},\nkeywords={Armijo stepsize,  Bilevel variational inequality problem,  Inertial method,  Non-Lipschitz operator,  Pseudomonotone operator},\nabbrev_source_title={Rev. R. Acad. Cienc. Exactas F{\\' i}s. Nat. Ser. A Mat. RACSAM},\n}\n\n
\n
\n\n\n
\n In this paper, we propose two new iterative algorithms to discover solutions of bilevel pseudomonotone variational inequalities with non-Lipschitz continuous operators in real Hilbert spaces. Our proposed algorithms need to compute the projection on the feasible set only once in each iteration although they employ Armijo line search methods. Strong convergence theorems of the suggested algorithms are established under suitable and weaker conditions. Some numerical experiments and applications are given to demonstrate the performance of the offered algorithms compared to some known ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Cho, S. Y.\n\n\n \n \n \n Strong convergence of inertial forward-backward methods for solving monotone inclusions.\n \n \n\n\n \n\n\n\n Applicable Analysis, 101(15): 5386–5414. 2022.\n \n\n(ESI Highly Cited Paper)\n\n
\n\n\n\n \n \n \"StrongPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TC_AA22,\nauthor={Tan, Bing and Cho, Sun Y.},\ntitle={Strong convergence of inertial forward-backward methods for solving monotone inclusions},\njournal={Applicable Analysis},\nyear={2022},\nvolume={101},\nnumber={15},\npages={5386--5414},\ndoi={10.1080/00036811.2021.1892080},\nurl={https://bingtan.me/files/paper/TC-AA2022.pdf},\nabstract={The paper presents four modifications of the inertial forward–backward splitting method for monotone inclusion problems in the framework of real Hilbert spaces. The advantages of our iterative schemes are that the single-valued operator is Lipschitz continuous monotone rather than cocoercive and the Lipschitz constant does not require to be known. The strong convergence of the suggested approaches is obtained under some standard and mild conditions. Finally, several numerical experiments in finite- and infinite-dimensional spaces are proposed to demonstrate the advantages of our algorithms over the existing related ones.},\nkeywords={Inclusion problem,  Inertial forward–backward method,  Projection and contraction method,  Tseng's extragradient method,  Viscosity method, Signal processing problem},\nabbrev_source_title={Appl. Anal.},\nbibbase_note={<span style="color: red">(ESI Highly Cited Paper)</span>},\n}\n\n
\n
\n\n\n
\n The paper presents four modifications of the inertial forward–backward splitting method for monotone inclusion problems in the framework of real Hilbert spaces. The advantages of our iterative schemes are that the single-valued operator is Lipschitz continuous monotone rather than cocoercive and the Lipschitz constant does not require to be known. The strong convergence of the suggested approaches is obtained under some standard and mild conditions. Finally, several numerical experiments in finite- and infinite-dimensional spaces are proposed to demonstrate the advantages of our algorithms over the existing related ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Cho, S. Y.\n\n\n \n \n \n Inertial extragradient algorithms with non-monotone stepsizes for pseudomonotone variational inequalities and applications.\n \n \n\n\n \n\n\n\n Computational and Applied Mathematics, 41(3): 121. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TC_COAM22,\nauthor={Tan, Bing and Cho, Sun Y.},\ntitle={Inertial extragradient algorithms with non-monotone stepsizes for pseudomonotone variational inequalities and applications},\njournal={Computational and Applied Mathematics},\nyear={2022},\nvolume={41},\nnumber={3},\ndoi={10.1007/s40314-022-01819-0},\npages={121},\nurl={https://bingtan.me/files/paper/TC-COAM2022.pdf},\nabstract={The goal of this paper is to construct several fast iterative algorithms for solving pseudomonotone variational inequalities in real Hilbert spaces. We introduce two extragradient algorithms with inertial terms and give a strong convergence analysis under suitable assumptions. The suggested algorithms need to compute the projection on the feasible set only once in each iteration and can update the step size adaptively without any line search condition. Some numerical experiments and applications are implemented to illustrate the advantages and efficiency of the suggested algorithms over the related known methods.},\nkeywords={Inertial method,  Pseudomonotone operator,  Subgradient extragradient method,  Tseng's extragradient method,  Variational inequality problem},\nabbrev_source_title={Comput. Appl. Math.},\n}\n\n
\n
\n\n\n
\n The goal of this paper is to construct several fast iterative algorithms for solving pseudomonotone variational inequalities in real Hilbert spaces. We introduce two extragradient algorithms with inertial terms and give a strong convergence analysis under suitable assumptions. The suggested algorithms need to compute the projection on the feasible set only once in each iteration and can update the step size adaptively without any line search condition. Some numerical experiments and applications are implemented to illustrate the advantages and efficiency of the suggested algorithms over the related known methods.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Cho, S. Y.\n\n\n \n \n \n Two new projection algorithms for variational inequalities in Hilbert spaces.\n \n \n\n\n \n\n\n\n Journal of Nonlinear and Convex Analysis, 23(11): 2523–2534. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"TwoPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TC_JNCA22,\nauthor={Tan, Bing and Cho, Sun Y.},\ntitle={Two new projection algorithms for variational inequalities in Hilbert spaces},\njournal={Journal of Nonlinear and Convex Analysis},\nyear={2022},\nvolume={23},\nnumber={11},\npages={2523--2534},\nurl={https://bingtan.me/files/paper/TC-JNCA2022.pdf},\nabstract={In this paper, two new projection-type algorithms are introduced for solving pseudomonotone variational inequalities in real Hilbert spaces. The proposed methods use two non-monotonic step sizes allowing them to work adaptively without the prior information of the Lipschitz constant of the operator. Strong convergence theorems for the proposed methods are established under suitable conditions. A fundamental numerical example is given to verify the efficiency of the suggested methods in comparison with some known ones.},\nkeywords={Inertial method, Pseudomonotone operator,  Variational inequality problem, Projection method},\nabbrev_source_title={J. Nonlinear Convex Anal.},\n}\n\n
\n
\n\n\n
\n In this paper, two new projection-type algorithms are introduced for solving pseudomonotone variational inequalities in real Hilbert spaces. The proposed methods use two non-monotonic step sizes allowing them to work adaptively without the prior information of the Lipschitz constant of the operator. Strong convergence theorems for the proposed methods are established under suitable conditions. A fundamental numerical example is given to verify the efficiency of the suggested methods in comparison with some known ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Zhou, Z.; Tan, B.; and Cho, S. Y.\n\n\n \n \n \n Alternated inertial subgradient extragradient methods for solving variational inequalities.\n \n \n\n\n \n\n\n\n Journal of Nonlinear and Convex Analysis, 23(11): 2593–2604. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"AlternatedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{ZTC_JNCA22,\nauthor={Zhou, Zheng and Tan, Bing and Cho, Sun Y.},\ntitle={Alternated inertial subgradient extragradient methods for solving variational inequalities},\njournal={Journal of Nonlinear and Convex Analysis},\nyear={2022},\nvolume={23},\nnumber={11},\npages={2593--2604},\nurl={https://bingtan.me/files/paper/ZTC-JNCA2022.pdf},\nabstract={The goal of this paper is to study some iterative algorithms for solving a pseudomonotone variational inequality in Hilbert spaces. The iterative algorithms presented in this paper are based on the alternated inertial method and the subgradient extragradient method. Weak convergence of the algorithms is established by the adaptive stepsize criterion in Hilbert spaces.},\nkeywords={Alternated inertial method, Pseudomonotone operator,  Variational inequality problem, Subgradient extragradient method},\nabbrev_source_title={J. Nonlinear Convex Anal.},\n}\n\n
\n
\n\n\n
\n The goal of this paper is to study some iterative algorithms for solving a pseudomonotone variational inequality in Hilbert spaces. The iterative algorithms presented in this paper are based on the alternated inertial method and the subgradient extragradient method. Weak convergence of the algorithms is established by the adaptive stepsize criterion in Hilbert spaces.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Cho, S. Y.\n\n\n \n \n \n Self-adaptive inertial shrinking projection algorithms for solving pseudomonotone variational inequalities.\n \n \n\n\n \n\n\n\n Journal of Nonlinear and Convex Analysis, 22(3): 613–627. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"Self-adaptivePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TC_JNCA21,\nauthor={Tan, Bing and Cho, Sun Y.},\ntitle={Self-adaptive inertial shrinking projection algorithms for solving pseudomonotone variational inequalities},\njournal={Journal of Nonlinear and Convex Analysis},\nyear={2021},\nvolume={22},\nnumber={3},\npages={613--627},\nurl={https://bingtan.me/files/paper/TC-JNCA2021.pdf},\nabstract={In this paper, we construct two fast iterative methods to solve pseudomonotone variational inequalities in real Hilbert spaces. The advantage of the suggested iterative schemes is that they can adaptively update the iterative step size through some previously known information without performing any line search process. Strong convergence theorems of the proposed algorithms are established under some relaxed conditions imposed on the parameters. Finally, several numerical tests are given to show the advantages and efficiency of the proposed approaches compared with the existing results.},\nkeywords={Inertial method, Subgradient extragradient method,  Tseng's extragradient method,  Pseudomonotone operator,  Shrinking projection method,  Variational inequality problem},\nabbrev_source_title={J. Nonlinear Convex Anal.},\n}\n\n
\n
\n\n\n
\n In this paper, we construct two fast iterative methods to solve pseudomonotone variational inequalities in real Hilbert spaces. The advantage of the suggested iterative schemes is that they can adaptively update the iterative step size through some previously known information without performing any line search process. Strong convergence theorems of the proposed algorithms are established under some relaxed conditions imposed on the parameters. Finally, several numerical tests are given to show the advantages and efficiency of the proposed approaches compared with the existing results.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Cho, S. Y.\n\n\n \n \n \n Inertial extragradient methods for solving pseudomonotone variational inequalities with non-lipschitz mappings and their optimization applications.\n \n \n\n\n \n\n\n\n Applied Set-Valued Analysis and Optimization, 3(2): 165–192. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TC_ASVAO21,\nauthor={Tan, Bing and Cho, Sun Y.},\ntitle={Inertial extragradient methods for solving pseudomonotone variational inequalities with non-lipschitz mappings and their optimization applications},\njournal={Applied Set-Valued Analysis and Optimization},\nyear={2021},\nvolume={3},\nnumber={2},\npages={165--192},\ndoi={10.23952/asvao.3.2021.2.03},\nurl={https://bingtan.me/files/paper/TC-ASVAO2021.pdf},\nabstract={In this paper, four extragradient-type algorithms with inertial terms are presented for solving the variational inequality problem with a pseudomonotone and non-Lipschitz continuous operator in real Hilbert spaces. Strong convergence theorems of the suggested methods are established under some suitable conditions imposed on the parameters. Finally, several computational tests and applications in optimal control problems are given to illustrate the efficiency and advantages of the proposed iterative schemes over some known ones.},\nkeywords={Inertial extragradient method,  Non-Lipschitz operator,  Pseudomonotone operator,  Variational inequality problem,  Viscosity method},\nabbrev_source_title={Appl. Set-Valued. Anal. Optim.},\n}\n\n
\n
\n\n\n
\n In this paper, four extragradient-type algorithms with inertial terms are presented for solving the variational inequality problem with a pseudomonotone and non-Lipschitz continuous operator in real Hilbert spaces. Strong convergence theorems of the suggested methods are established under some suitable conditions imposed on the parameters. Finally, several computational tests and applications in optimal control problems are given to illustrate the efficiency and advantages of the proposed iterative schemes over some known ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Cho, S. Y.\n\n\n \n \n \n An inertial mann-like algorithm for fixed points of nonexpansive mappings in Hilbert spaces.\n \n \n\n\n \n\n\n\n Journal of Applied and Numerical Optimization, 2(3): 335–351. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TC_JANO20,\nauthor={Tan, Bing and Cho, Sun Y.},\ntitle={An inertial mann-like algorithm for fixed points of nonexpansive mappings in {H}ilbert spaces},\njournal={Journal of Applied and Numerical Optimization},\nyear={2020},\nvolume={2},\nnumber={3},\npages={335--351},\ndoi={10.23952/jano.2.2020.3.05},\nurl={https://bingtan.me/files/paper/TC-JANO2020.pdf},\nabstract={In this paper, we investigate an inertial Mann-like algorithm for fixed points of nonexpansive mappings in Hilbert spaces and obtain strong convergence results under some mild assumptions. Based on this, we derive a forward-backward algorithm involving Tikhonov regularization terms, which converges strongly to the solution of the monotone inclusion problem. We demonstrate the advantages of our algorithms comparing with some existing ones in the literature via split feasibility problem, variational inequality problem and signal recovery problem.},\nkeywords={Forward-backward splitting algorithm,  Inertial method, Mann method,  Nonexpansive mapping,  Strong convergence,  Tikhonov regularization},\nabbrev_source_title={J. Appl. Numer. Optim.},\n}\n\n
\n
\n\n\n
\n In this paper, we investigate an inertial Mann-like algorithm for fixed points of nonexpansive mappings in Hilbert spaces and obtain strong convergence results under some mild assumptions. Based on this, we derive a forward-backward algorithm involving Tikhonov regularization terms, which converges strongly to the solution of the monotone inclusion problem. We demonstrate the advantages of our algorithms comparing with some existing ones in the literature via split feasibility problem, variational inequality problem and signal recovery problem.\n
\n\n\n
\n\n\n
\n \n\n \n \n Liu, L.; Tan, B.; and Cho, S. Y.\n\n\n \n \n \n On the resolution of variational inequality problems with a double-hierarchical structure.\n \n \n\n\n \n\n\n\n Journal of Nonlinear and Convex Analysis, 21(2): 377–386. 2020.\n \n\n(ESI Highly Cited Paper)\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{LTC_JNCA20,\nauthor={Liu, Liya and Tan, Bing and Cho, Sun Y.},\ntitle={On the resolution of variational inequality problems with a double-hierarchical structure},\njournal={Journal of Nonlinear and Convex Analysis},\nyear={2020},\nvolume={21},\nnumber={2},\npages={377--386},\nurl={https://bingtan.me/files/paper/LTC-JNCA2020.pdf},\nabstract={In this paper, we discuss a pseudo-monotone variational inequality problem with a variational inequality constraint over a general, nonempty, closed and convex set, which is called the double-hierarchical constrained optimization problem. In addition, we propose an iterative algorithm by incorporating inertial terms in the extragradient algorithm. Strong convergence of the algorithm to the unique solution of the problem is guaranteed under certain assumptions.},\nkeywords={Constrained optimization problem,  Inertial method, Pseudomonotone operator,  Variational inequality problem},\nabbrev_source_title={J. Nonlinear Convex Anal.},\nbibbase_note={<span style="color: red">(ESI Highly Cited Paper)</span>},\n}\n\n
\n
\n\n\n
\n In this paper, we discuss a pseudo-monotone variational inequality problem with a variational inequality constraint over a general, nonempty, closed and convex set, which is called the double-hierarchical constrained optimization problem. In addition, we propose an iterative algorithm by incorporating inertial terms in the extragradient algorithm. Strong convergence of the algorithm to the unique solution of the problem is guaranteed under certain assumptions.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n Cho, Y.\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Tan, B.; Sunthrayuth, P.; Cholamjiak, P.; and Cho, Y. J.\n\n\n \n \n \n Modified inertial extragradient methods for finding minimum-norm solution of the variational inequality problem with applications to optimal control problem.\n \n \n\n\n \n\n\n\n International Journal of Computer Mathematics, 100(3): 525–545. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"ModifiedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TSCC_IJCM23,\nauthor={Tan, Bing and Sunthrayuth, Pongsakorn and Cholamjiak, Prasit and  Cho, Yeol J.},\ntitle={Modified inertial extragradient methods for finding minimum-norm solution of the variational inequality problem with applications to optimal control problem},\njournal={International Journal of Computer Mathematics},\nyear={2023},\nvolume={100},\nnumber={3},\npages={525--545},\ndoi={10.1080/00207160.2022.2137672},\nurl={https://bingtan.me/files/paper/TSCC-IJCM23.pdf},\nabstract={In order to discover the minimum-norm solution of the pseudomonotone variational inequality problem in a real Hilbert space, we provide two variants of the inertial extragradient approach with a novel generalized adaptive step size. Two of the suggested algorithms make use of the projection and contraction methods. We demonstrate several strong convergence findings without requiring the prior knowledge of the Lipschitz constant of the mapping. Finally, we give a number of numerical examples that highlight the benefits and effectiveness of the suggested algorithms and how they may be used to solve the optimal control problem.},\nkeywords={Variational inequality problem, Optimal control problem, Inertial method, Projection and contraction method},\nabbrev_source_title={Int. J. Comput. Math.},\n}\n\n
\n
\n\n\n
\n In order to discover the minimum-norm solution of the pseudomonotone variational inequality problem in a real Hilbert space, we provide two variants of the inertial extragradient approach with a novel generalized adaptive step size. Two of the suggested algorithms make use of the projection and contraction methods. We demonstrate several strong convergence findings without requiring the prior knowledge of the Lipschitz constant of the mapping. Finally, we give a number of numerical examples that highlight the benefits and effectiveness of the suggested algorithms and how they may be used to solve the optimal control problem.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n Cholamjiak, P.\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Tan, B.; Sunthrayuth, P.; Cholamjiak, P.; and Cho, Y. J.\n\n\n \n \n \n Modified inertial extragradient methods for finding minimum-norm solution of the variational inequality problem with applications to optimal control problem.\n \n \n\n\n \n\n\n\n International Journal of Computer Mathematics, 100(3): 525–545. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"ModifiedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TSCC_IJCM23,\nauthor={Tan, Bing and Sunthrayuth, Pongsakorn and Cholamjiak, Prasit and  Cho, Yeol J.},\ntitle={Modified inertial extragradient methods for finding minimum-norm solution of the variational inequality problem with applications to optimal control problem},\njournal={International Journal of Computer Mathematics},\nyear={2023},\nvolume={100},\nnumber={3},\npages={525--545},\ndoi={10.1080/00207160.2022.2137672},\nurl={https://bingtan.me/files/paper/TSCC-IJCM23.pdf},\nabstract={In order to discover the minimum-norm solution of the pseudomonotone variational inequality problem in a real Hilbert space, we provide two variants of the inertial extragradient approach with a novel generalized adaptive step size. Two of the suggested algorithms make use of the projection and contraction methods. We demonstrate several strong convergence findings without requiring the prior knowledge of the Lipschitz constant of the mapping. Finally, we give a number of numerical examples that highlight the benefits and effectiveness of the suggested algorithms and how they may be used to solve the optimal control problem.},\nkeywords={Variational inequality problem, Optimal control problem, Inertial method, Projection and contraction method},\nabbrev_source_title={Int. J. Comput. Math.},\n}\n\n
\n
\n\n\n
\n In order to discover the minimum-norm solution of the pseudomonotone variational inequality problem in a real Hilbert space, we provide two variants of the inertial extragradient approach with a novel generalized adaptive step size. Two of the suggested algorithms make use of the projection and contraction methods. We demonstrate several strong convergence findings without requiring the prior knowledge of the Lipschitz constant of the mapping. Finally, we give a number of numerical examples that highlight the benefits and effectiveness of the suggested algorithms and how they may be used to solve the optimal control problem.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n Dong, Q.\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Zhou, X.; Cai, G.; Tan, B.; and Dong, Q. L.\n\n\n \n \n \n A modified generalized version of projected reflected gradient method in Hilbert spaces.\n \n \n\n\n \n\n\n\n Numerical Algorithms, doi:10.1007/s11075-023-01566-1. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{ZCTD_NUMA23,\nauthor={Zhou, Xiaolin and Cai, Gang and Tan, Bing and Dong, Qiao L.},\ntitle={A modified generalized version of projected reflected gradient method in Hilbert spaces},\njournal={Numerical Algorithms},\nyear={2023},\nvolume={doi:10.1007/s11075-023-01566-1},\ndoi={10.1007/s11075-023-01566-1},\nurl={https://bingtan.me/files/paper/ZCTD-NUMA2023.pdf},\nabstract={This article is concerned with a universal version of projected reflected gradient method with new step size for solving variational inequality problem in Hilbert spaces. Under appropriate assumptions controlled by the operators and parameters, we acquire the weak convergence of the proposed algorithm. We establish an R-linear convergence rate of our method on the condition that the relevant mapping is strongly monotone. We rework our first algorithm so that it can be simplified to several generalized methods in the literature. The efficacy and availability of our proposed iterative scheme are demonstrated in numerical experiments.},\nkeywords={Projected reflected gradient method, Variational inequality, Weak and linear convergence, Hilbert spaces},\nabbrev_source_title={Numer. Algorithms},\n}\n\n
\n
\n\n\n
\n This article is concerned with a universal version of projected reflected gradient method with new step size for solving variational inequality problem in Hilbert spaces. Under appropriate assumptions controlled by the operators and parameters, we acquire the weak convergence of the proposed algorithm. We establish an R-linear convergence rate of our method on the condition that the relevant mapping is strongly monotone. We rework our first algorithm so that it can be simplified to several generalized methods in the literature. The efficacy and availability of our proposed iterative scheme are demonstrated in numerical experiments.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n Fan, J.\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n Fan, J.; Qin, X.; and Tan, B.\n\n\n \n \n \n Tseng's extragradient algorithm for pseudomonotone variational inequalities on Hadamard manifolds.\n \n \n\n\n \n\n\n\n Applicable Analysis, 101(6): 2372–2385. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"Tseng'sPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{FQT_AA22,\nauthor={Fan, Jingjing and Qin, Xiaolong and Tan, Bing},\ntitle={Tseng's extragradient algorithm for pseudomonotone variational inequalities on {H}adamard manifolds},\njournal={Applicable Analysis},\nyear={2022},\nvolume={101},\nnumber={6},\npages={2372--2385},\ndoi={10.1080/00036811.2020.1807012},\nurl={https://bingtan.me/files/paper/FQT-AA2022.pdf},\nabstract={In this paper, we investigate the Tseng's extragradient algorithm for non-Lipschitzian variational inequalities with pseudomonotone vector fields on Hadamard manifolds. The convergence analysis of the proposed algorithm is discussed under mild assumptions. Two experiments are provided to illustrate the asymptotical behavior of the algorithm. The results presented in this paper generalize some known results presented in the literature.},\nkeywords={Extragradient method,  Hadamard manifolds,  Non-Lipschitz operator,  Pseudomonotone vector field,  Variational inequality problem},\nabbrev_source_title={Appl. Anal.},\n}\n\n
\n
\n\n\n
\n In this paper, we investigate the Tseng's extragradient algorithm for non-Lipschitzian variational inequalities with pseudomonotone vector fields on Hadamard manifolds. The convergence analysis of the proposed algorithm is discussed under mild assumptions. Two experiments are provided to illustrate the asymptotical behavior of the algorithm. The results presented in this paper generalize some known results presented in the literature.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Fan, J.; and Qin, X.\n\n\n \n \n \n Inertial extragradient algorithms with non-monotonic step sizes for solving variational inequalities and fixed point problems.\n \n \n\n\n \n\n\n\n Advances in Operator Theory, 6(4): 61. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TFQ_AIOT21,\nauthor={Tan, Bing and Fan, Jingjing and Qin, Xiaolong},\ntitle={Inertial extragradient algorithms with non-monotonic step sizes for solving variational inequalities and fixed point problems},\njournal={Advances in Operator Theory},\nyear={2021},\nvolume={6},\nnumber={4},\ndoi={10.1007/s43036-021-00155-0},\npages={61},\nurl={https://bingtan.me/files/paper/TFQ-AIOT2021.pdf},\nabstract={In this paper, we introduce four inertial extragradient algorithms with non-monotonic step sizes to find the solution of the convex feasibility problem, which consists of a monotone variational inequality problem and a fixed point problem with a demicontractive mapping. Strong convergence theorems of the suggested algorithms are established under some standard conditions. Finally, we implement some computational tests to show the efficiency and advantages of the proposed algorithms and compare them with some existing ones.},\nkeywords={Fixed point problem,  Inertial method,  Strong convergence,  Subgradient extragradient method,  Tseng's extragradient method,  Variational inequality problem},\nabbrev_source_title={Adv. Oper. Theory},\n}\n\n
\n
\n\n\n
\n In this paper, we introduce four inertial extragradient algorithms with non-monotonic step sizes to find the solution of the convex feasibility problem, which consists of a monotone variational inequality problem and a fixed point problem with a demicontractive mapping. Strong convergence theorems of the suggested algorithms are established under some standard conditions. Finally, we implement some computational tests to show the efficiency and advantages of the proposed algorithms and compare them with some existing ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Fan, J.; and Li, S.\n\n\n \n \n \n Self-adaptive inertial extragradient algorithms for solving variational inequality problems.\n \n \n\n\n \n\n\n\n Computational and Applied Mathematics, 40(1): 19. 2021.\n \n\n(ESI Highly Cited Paper)\n\n
\n\n\n\n \n \n \"Self-adaptivePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TFL_COAM21,\nauthor={Tan, Bing and Fan, Jingjing and Li, Songxiao},\ntitle={Self-adaptive inertial extragradient algorithms for solving variational inequality problems},\njournal={Computational and Applied Mathematics},\nyear={2021},\nvolume={40},\nnumber={1},\ndoi={10.1007/s40314-020-01393-3},\npages={19},\nurl={https://bingtan.me/files/paper/TFL-COAM2021.pdf},\nabstract={In this paper, we study the strong convergence of two Mann-type inertial extragradient algorithms, which are devised with a new step size, for solving a variational inequality problem with a monotone and Lipschitz continuous operator in real Hilbert spaces. Strong convergence theorems for the suggested algorithms are proved without the prior knowledge of the Lipschitz constant of the operator. Finally, we provide some numerical experiments to illustrate the performance of the proposed algorithms and provide a comparison with related ones.},\nkeywords={Inertial method,  Mann method,  Subgradient extragradient method,  Tseng's extragradient method,  Variational inequality problem},\nabbrev_source_title={Comput. Appl. Math.},\nbibbase_note={<span style="color: red">(<s>ESI Highly Cited Paper</s>)</span>},\n}\n\n
\n
\n\n\n
\n In this paper, we study the strong convergence of two Mann-type inertial extragradient algorithms, which are devised with a new step size, for solving a variational inequality problem with a monotone and Lipschitz continuous operator in real Hilbert spaces. Strong convergence theorems for the suggested algorithms are proved without the prior knowledge of the Lipschitz constant of the operator. Finally, we provide some numerical experiments to illustrate the performance of the proposed algorithms and provide a comparison with related ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Fan, J.; Tan, B.; and Li, S.\n\n\n \n \n \n An explicit extragradient algorithm for equilibrium problems on HHadamard manifolds.\n \n \n\n\n \n\n\n\n Computational and Applied Mathematics, 40(2): 68. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{FTL_COAM21,\nauthor={Fan, Jingjing and Tan, Bing and Li, Songxiao},\ntitle={An explicit extragradient algorithm for equilibrium problems on {H}{H}adamard manifolds},\njournal={Computational and Applied Mathematics},\nyear={2021},\nvolume={40},\nnumber={2},\ndoi={10.1007/s40314-021-01427-4},\npages={68},\nurl={https://bingtan.me/files/paper/FTL-COAM2021.pdf},\nabstract={In this paper, we investigate a new extragradient algorithm for solving pseudomonotone equilibrium problems on Hadamard manifolds. Our algorithm uses a variable stepsize, which is updated at each iteration and based on some previous iterates. The convergence analysis of the proposed algorithm is discussed under mild assumptions. In the case where the equilibrium bifunction is strongly pseudomonotone, the R-linear rate of convergence of the new algorithm is formulated. A fundamental experiment is provided to illustrate the numerical behavior of the algorithm.},\nkeywords={Equilibrium problem,  Extragradient method,  Hadamard manifolds,  Lipschitz-type bifunction,  Pseudomonotone bifunction},\nabbrev_source_title={Comput. Appl. Math.},\n}\n\n
\n
\n\n\n
\n In this paper, we investigate a new extragradient algorithm for solving pseudomonotone equilibrium problems on Hadamard manifolds. Our algorithm uses a variable stepsize, which is updated at each iteration and based on some previous iterates. The convergence analysis of the proposed algorithm is discussed under mild assumptions. In the case where the equilibrium bifunction is strongly pseudomonotone, the R-linear rate of convergence of the new algorithm is formulated. A fundamental experiment is provided to illustrate the numerical behavior of the algorithm.\n
\n\n\n
\n\n\n
\n \n\n \n \n Fan, J.; Qin, X.; and Tan, B.\n\n\n \n \n \n Convergence of an inertial shadow Douglas-Rachford splitting algorithm for monotone inclusions.\n \n \n\n\n \n\n\n\n Numerical Functional Analysis and Optimization, 42(14): 1627–1644. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"ConvergencePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{FQT_NFAO21,\nauthor={Fan, Jingjing and Qin, Xiaolong and Tan, Bing},\ntitle={Convergence of an inertial shadow {D}ouglas-{R}achford splitting algorithm for monotone inclusions},\njournal={Numerical Functional Analysis and Optimization},\nyear={2021},\nvolume={42},\nnumber={14},\npages={1627--1644},\ndoi={10.1080/01630563.2021.2001749},\nurl={https://bingtan.me/files/paper/FQT-NFAO2021.pdf},\nabstract={An inertial shadow Douglas-Rachford splitting algorithm for finding zeros of the sum of monotone operators is proposed in Hilbert spaces. Moreover, a three-operator splitting algorithm for solving a class of monotone inclusion problems is also concerned. The weak convergence of the algorithms is investigated under mild assumptions. Some numerical experiments are implemented to illustrate our main convergence results.},\nkeywords={Inertial method,  Monotone inclusion,  Shadow Douglas-Rachford splitting algorithm,  Three-operator splitting},\nabbrev_source_title={Numer. Funct. Anal. Optim.},\n}\n\n
\n
\n\n\n
\n An inertial shadow Douglas-Rachford splitting algorithm for finding zeros of the sum of monotone operators is proposed in Hilbert spaces. Moreover, a three-operator splitting algorithm for solving a class of monotone inclusion problems is also concerned. The weak convergence of the algorithms is investigated under mild assumptions. Some numerical experiments are implemented to illustrate our main convergence results.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n Gibali, A.\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Tan, B.; Qin, X.; and Gibali, A.\n\n\n \n \n \n Three approximation methods for solving constraint variational inequalities and related problems.\n \n \n\n\n \n\n\n\n Pure and Applied Functional Analysis, 8(3): 965–986. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"ThreePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TGQ_PAFA23,\nauthor={Tan, Bing and Qin, Xiaolong and Gibali, Aviv},\ntitle={Three approximation methods for solving constraint variational inequalities and related problems},\njournal={Pure and Applied Functional Analysis},\nyear={2023},\nvolume={8},\nnumber={3},\npages={965--986},\nurl={https://bingtan.me/files/paper/TGQ_PAFA2023.pdf},\nabstract={In this paper, we present three new self-adaptive one-projection algorithms to find common solutions for the pseudo-monotone variational inequality problem and the fixed point problem of a demi-contractive mapping. Note that the suggested approaches use a non-monotonic self-adaptive step size so that they can work well without knowing the prior knowledge of the Lipschitz constant of the mapping. Strong convergence theorems of the proposed iterative schemes are established in real Hilbert spaces. Several mathematical experiments are reported to demonstrate the numerical behavior of the suggested algorithms and compare them with the existing ones. Finally, the suggested methods are used to solve optimal control problems.},\nkeywords={Variational inequality, Fixed point, Extragradient method, Hybrid steepest descent method, Pseudomonotone mapping},\nabbrev_source_title={Pure Appl. Funct. Anal.},\n}\n\n
\n
\n\n\n
\n In this paper, we present three new self-adaptive one-projection algorithms to find common solutions for the pseudo-monotone variational inequality problem and the fixed point problem of a demi-contractive mapping. Note that the suggested approaches use a non-monotonic self-adaptive step size so that they can work well without knowing the prior knowledge of the Lipschitz constant of the mapping. Strong convergence theorems of the proposed iterative schemes are established in real Hilbert spaces. Several mathematical experiments are reported to demonstrate the numerical behavior of the suggested algorithms and compare them with the existing ones. Finally, the suggested methods are used to solve optimal control problems.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n Hu, S.\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Hu, S.; Wang, Y.; Tan, B.; and Wang, F.\n\n\n \n \n \n Inertial iterative method for solving variational inequality problems of pseudo-monotone operators and fixed point problems of nonexpansive mappings in Hilbert spaces.\n \n \n\n\n \n\n\n\n Journal of Industrial and Management Optimization, 19(4): 2655–2675. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{HWTW_JIMO23,\nauthor={Hu, Shaotao and Wang, Yuanheng and Tan, Bing and Wang, Fenghui},\ntitle={Inertial iterative method for solving variational inequality problems of pseudo-monotone operators and fixed point problems of nonexpansive mappings in {H}ilbert spaces},\njournal={Journal of Industrial and Management Optimization},\nyear={2023},\nvolume={19},\nnumber={4},\npages={2655--2675},\ndoi={10.3934/jimo.2022060},\nurl={https://bingtan.me/files/paper/HWTW-JIMO2023.pdf},\nabstract={In this paper, we propose a new inertial viscosity iterative algorithm for solving the variational inequality problem with a pseudo-monotone operator and the fixed point problem involving a nonexpansive mapping in real Hilbert spaces. The advantage of the proposed algorithm is that it can work without the prior knowledge of the Lipschitz constant of the mapping. The strong convergence of the sequence generated by the proposed algorithm is proved under some suitable assumptions imposed on the parameters. Some numerical experiments are given to support our main results.},\nkeywords={Inertial method,  Viscosity method,  Strong convergence, Variational inequality problem, Fixed point problem, Nonexpansive mapping, Pseudomonotone operator},\nabbrev_source_title={J. Ind. Manag. Optim.},\n}\n\n
\n
\n\n\n
\n In this paper, we propose a new inertial viscosity iterative algorithm for solving the variational inequality problem with a pseudo-monotone operator and the fixed point problem involving a nonexpansive mapping in real Hilbert spaces. The advantage of the proposed algorithm is that it can work without the prior knowledge of the Lipschitz constant of the mapping. The strong convergence of the sequence generated by the proposed algorithm is proved under some suitable assumptions imposed on the parameters. Some numerical experiments are given to support our main results.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n Latif, A.\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Liu, L.; Tan, B.; and Latif, A.\n\n\n \n \n \n Approximation of fixed points for a semigroup of Bregman quasi-nonexpansive mappings in Banach spaces.\n \n \n\n\n \n\n\n\n Journal of Nonlinear and Variational Analysis, 5(1): 9–22. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"ApproximationPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{LTL_JNVA21,\nauthor={Liu, Liya and Tan, Bing and Latif, A.},\ntitle={Approximation of fixed points for a semigroup of Bregman quasi-nonexpansive mappings in {B}anach spaces},\njournal={Journal of Nonlinear and Variational Analysis},\nyear={2021},\nvolume={5},\nnumber={1},\npages={9--22},\ndoi={10.23952/jnva.5.2021.1.02},\nurl={https://bingtan.me/files/paper/LTL-JNVA2021.pdf},\nabstract={The purpose of this paper is to study the iterative scheme of the Halpern type for a commutative semigroup $\\mathfrak{J}=\\left\\{S_{\\lambda}: \\lambda \\in \\mathcal{Q}\\right\\}$ of Bregman quasi-nonexpansive mappings on a closed and convex subset of a Banach space. A strong convergence theorem is established for finding a common fixed point solution. Our results extend and improve some related results in the current literature. In addition, we present numerical examples to illustrate the performance of our method in finite and infinite dimensional spaces.},\nkeywords={Banach space,  Bregman quasi-nonexpansive,  Fixed point problem,  Halpern method,  Strong convergence},\nabbrev_source_title={J. Nonlinear Var. Anal.},\n}\n\n
\n
\n\n\n
\n The purpose of this paper is to study the iterative scheme of the Halpern type for a commutative semigroup $\\mathfrak{J}=łeft\\{S_{λ}: λ ∈ \\mathcal{Q}i̊ght\\}$ of Bregman quasi-nonexpansive mappings on a closed and convex subset of a Banach space. A strong convergence theorem is established for finding a common fixed point solution. Our results extend and improve some related results in the current literature. In addition, we present numerical examples to illustrate the performance of our method in finite and infinite dimensional spaces.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n Li, S.\n \n \n (23)\n \n \n
\n
\n \n \n
\n \n\n \n \n Tan, B.; Li, S.; and Cho, S. Y.\n\n\n \n \n \n Inertial projection and contraction methods for pseudomonotone variational inequalities with non-Lipschitz operators and applications.\n \n \n\n\n \n\n\n\n Applicable Analysis, 102(4): 1199–1221. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TLC_AA23,\nauthor={Tan, Bing and Li, Songxiao and Cho, Sun Y.},\ntitle={Inertial projection and contraction methods for pseudomonotone variational inequalities with non-Lipschitz operators and applications},\njournal={Applicable Analysis},\nyear={2023},\nvolume={102},\nnumber={4},\ndoi={10.1080/00036811.2021.1979219},\npages={1199--1221},\nurl={https://bingtan.me/files/paper/TLC-AA2023.pdf},\nabstract={In this paper, some new accelerated iterative schemes are proposed to solve the variational inequality problem with a pseudomonotone and uniformly continuous operator in real Hilbert spaces. Strong convergence theorems of the suggested algorithms are obtained without the prior knowledge of the Lipschitz constant of the operator. Some numerical experiments and applications are performed to illustrate the advantages of the proposed methods with respect to several related ones.},\nkeywords={Inertial extragradient method,  Projection and contraction method,  Pseudomonotone operator,  Non-Lipschitz operator,  Variational inequality problem},\nabbrev_source_title={Appl. Anal.},\n}\n\n
\n
\n\n\n
\n In this paper, some new accelerated iterative schemes are proposed to solve the variational inequality problem with a pseudomonotone and uniformly continuous operator in real Hilbert spaces. Strong convergence theorems of the suggested algorithms are obtained without the prior knowledge of the Lipschitz constant of the operator. Some numerical experiments and applications are performed to illustrate the advantages of the proposed methods with respect to several related ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Li, S.\n\n\n \n \n \n Adaptive inertial subgradient extragradient methods for finding minimum-norm solutions of pseudomonotone variational inequalities.\n \n \n\n\n \n\n\n\n Journal of Industrial and Management Optimization, 19(10): 7640–7659. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"AdaptivePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TL_JIMO23,\nauthor={Tan, Bing and Li, Songxiao},\ntitle={Adaptive inertial subgradient extragradient methods for finding minimum-norm solutions of pseudomonotone variational inequalities},\njournal={Journal of Industrial and Management Optimization},\nyear={2023},\nvolume={19},\nnumber={10},\npages={7640--7659},\ndoi={10.3934/jimo.2022060},\nurl={https://bingtan.me/files/paper/TL-JIMO2023.pdf},\nabstract={In this paper, four modified inertial subgradient extragradient methods with a new non-monotonic step size criterion are investigated for pseudomonotone variational inequality problems in real Hilbert spaces. Our algorithms employ two different step sizes in each iteration to update the values of iterative sequences, and they work well without the prior information about the Lipschitz constant of the operator. Strong convergence theorems of the proposed iterative schemes are established under some suitable and mild conditions. Some numerical examples are provided to demonstrate the computational efficiency and advantages of the proposed methods over other known ones.},\nkeywords={Variational inequality problem, Inertial method, Extragradient method, Pseudomonotone operator, Non-Lipschitz operator},\nabbrev_source_title={J. Ind. Manag. Optim.},\n}\n\n
\n
\n\n\n
\n In this paper, four modified inertial subgradient extragradient methods with a new non-monotonic step size criterion are investigated for pseudomonotone variational inequality problems in real Hilbert spaces. Our algorithms employ two different step sizes in each iteration to update the values of iterative sequences, and they work well without the prior information about the Lipschitz constant of the operator. Strong convergence theorems of the proposed iterative schemes are established under some suitable and mild conditions. Some numerical examples are provided to demonstrate the computational efficiency and advantages of the proposed methods over other known ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Zhou, Z.; Tan, B.; and Li, S.\n\n\n \n \n \n Inertial algorithms with adaptive stepsizes for split variational inclusion problems and their applications to signal recovery problem.\n \n \n\n\n \n\n\n\n Mathematical Methods in the Applied Sciences, doi:10.1002/mma.9436. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{ZTL_MMAS23,\nauthor={Zhou, Zheng and Tan, Bing and Li, Songxiao},\ntitle={Inertial algorithms with adaptive stepsizes for split variational inclusion problems and their applications to signal recovery problem},\njournal={Mathematical Methods in the Applied Sciences},\nyear={2023},\nvolume={doi:10.1002/mma.9436},\ndoi={10.1002/mma.9436},\nurl={https://bingtan.me/files/paper/ZTL-MMAS2023.pdf},\nabstract={With the help of the Meir-Keeler contraction method and the Mann-type method, two adaptive inertial iterative schemes are introduced for finding solutions of the split variational inclusion problem in Hilbert spaces. The strong convergence of the suggested algorithms is guaranteed by a new stepsize criterion that does not require calculation of the bounded linear operator norm. Some numerical experiments and applications in signal recovery problems are given to demonstrate the efficiency of the proposed algorithms.},\nkeywords={Adaptive stepsize, Inertial method, Mann method, Meir-Keeler contraction, Signal recovery, Split variational inclusion problem},\nabbrev_source_title={Math. Methods Appl. Sci.},\n}\n\n
\n
\n\n\n
\n With the help of the Meir-Keeler contraction method and the Mann-type method, two adaptive inertial iterative schemes are introduced for finding solutions of the split variational inclusion problem in Hilbert spaces. The strong convergence of the suggested algorithms is guaranteed by a new stepsize criterion that does not require calculation of the bounded linear operator norm. Some numerical experiments and applications in signal recovery problems are given to demonstrate the efficiency of the proposed algorithms.\n
\n\n\n
\n\n\n
\n \n\n \n \n Luo, Y.; Tan, B.; and Li, S.\n\n\n \n \n \n Inertial splitting algorithms for nonlinear operators of pseudocontractive and accretive types.\n \n \n\n\n \n\n\n\n Optimization, 72(3): 647–675. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{LTL_OPT23,\nauthor={Luo, Yinglin and Tan, Bing and Li, Songxiao},\ntitle={Inertial splitting algorithms for nonlinear operators of pseudocontractive and accretive types},\njournal={Optimization},\nyear={2023},\nvolume={72},\nnumber={3},\npages={647--675},\ndoi={10.1080/02331934.2021.1981896},\nurl={https://bingtan.me/files/paper/LTL-OPT2023.pdf},\nabstract={In this paper, inertial splitting algorithms for nonlinear operators of pseudocontractive and accretive types are proposed. Weak and strong convergence theorems are established in uniformly convex and $q$-uniformly smooth Banach spaces. Numerical examples are given to illustrate the effectiveness of our proposed algorithms.},\nkeywords={Accretive operator,  Banach space,  Inertial method,  Strict pseudo-contraction,  Strong convergence},\nabbrev_source_title={Optimization},\n}\n\n
\n
\n\n\n
\n In this paper, inertial splitting algorithms for nonlinear operators of pseudocontractive and accretive types are proposed. Weak and strong convergence theorems are established in uniformly convex and $q$-uniformly smooth Banach spaces. Numerical examples are given to illustrate the effectiveness of our proposed algorithms.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Li, S.\n\n\n \n \n \n Modified inertial projection and contraction algorithms with non-monotonic step sizes for solving variational inequalities and their applications.\n \n \n\n\n \n\n\n\n Optimization, doi:10.1080/02331934.2022.2123705. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"ModifiedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TL_OPT22,\nauthor={Tan, Bing and Li, Songxiao},\ntitle={Modified inertial projection and contraction algorithms with non-monotonic step sizes for solving variational inequalities and their applications},\njournal={Optimization},\nyear={2022},\nvolume={doi:10.1080/02331934.2022.2123705},\ndoi={10.1080/02331934.2022.2123705},\nurl={https://bingtan.me/files/paper/TL-OPT2022.pdf},\nabstract={We present two adaptive inertial projection and contraction algorithms to discover the minimum-norm solutions of pseudomonotone variational inequality problems in real Hilbert spaces. The suggested algorithms employ two different step sizes in each iteration and use a non-monotone step size criterion without any line search allowing them to work adaptively. The strong convergence of the iterative sequences formed by the proposed algorithms is established under some mild conditions. Several numerical experiments occurring in finite- and infinite-dimensional Hilbert spaces and applications to optimal control problems as well as signal processing problems are given. Performance profiles are used to verify the computational efficiency and advantages of the proposed algorithms with respect to some known ones.},\nkeywords={Variational inequality problem,  Inertial method,  Projection and contraction method,  Subgradient extragradient method, Pseudomonotone operator, Optimal control problem, Signal processing problem, Strong convergence},\nabbrev_source_title={Optimization},\n}\n\n
\n
\n\n\n
\n We present two adaptive inertial projection and contraction algorithms to discover the minimum-norm solutions of pseudomonotone variational inequality problems in real Hilbert spaces. The suggested algorithms employ two different step sizes in each iteration and use a non-monotone step size criterion without any line search allowing them to work adaptively. The strong convergence of the iterative sequences formed by the proposed algorithms is established under some mild conditions. Several numerical experiments occurring in finite- and infinite-dimensional Hilbert spaces and applications to optimal control problems as well as signal processing problems are given. Performance profiles are used to verify the computational efficiency and advantages of the proposed algorithms with respect to some known ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Li, S.\n\n\n \n \n \n Revisiting projection and contraction algorithms for solving variational inequalities and applications.\n \n \n\n\n \n\n\n\n Applied Set-Valued Analysis and Optimization, 4(2): 167–183. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"RevisitingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TL_ASVAO22,\nauthor={Tan, Bing and Li, Songxiao},\ntitle={Revisiting projection and contraction algorithms for solving variational inequalities and applications},\njournal={Applied Set-Valued Analysis and Optimization},\nyear={2022},\nvolume={4},\nnumber={2},\npages={167--183},\ndoi={10.23952/asvao.4.2022.2.03},\nurl={https://bingtan.me/files/paper/TL-ASVAO2022.pdf},\nabstract={We provide two novel projection and contraction algorithms to find the minimum-norm solution of the variational inequality problem with a pseudo monotone and non-Lipschitz continuous operator in a real Hilbert space. Our algorithms can work adaptively without requiring the prior information of the Lipschitz constant of the operator. Strong convergence theorems for the suggested iterative algorithms are established under suitable conditions. Some numerical experiments are discussed to demonstrate the computational efficiency of the proposed algorithms in comparison with several existing ones.},\nkeywords={Variational inequality problem, Subgradient extragradient method, Projection and contraction method, Inertial method, Pseudomonotone operator},\nabbrev_source_title={Appl. Set-Valued Anal. Optim.},\n}\n\n
\n
\n\n\n
\n We provide two novel projection and contraction algorithms to find the minimum-norm solution of the variational inequality problem with a pseudo monotone and non-Lipschitz continuous operator in a real Hilbert space. Our algorithms can work adaptively without requiring the prior information of the Lipschitz constant of the operator. Strong convergence theorems for the suggested iterative algorithms are established under suitable conditions. Some numerical experiments are discussed to demonstrate the computational efficiency of the proposed algorithms in comparison with several existing ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Zhou, Z.; and Li, S.\n\n\n \n \n \n Viscosity-type inertial extragradient algorithms for solving variational inequality problems and fixed point problems.\n \n \n\n\n \n\n\n\n Journal of Applied Mathematics and Computing, 68(2): 1387–1411. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"Viscosity-typePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TZL_JAMC22,\nauthor={Tan, Bing and Zhou, Zheng and Li, Songxiao},\ntitle={Viscosity-type inertial extragradient algorithms for solving variational inequality problems and fixed point problems},\njournal={Journal of Applied Mathematics and Computing},\nyear={2022},\nvolume={68},\nnumber={2},\npages={1387--1411},\ndoi={10.1007/s12190-021-01576-z},\nurl={https://bingtan.me/files/paper/TZL-JAMC2022.pdf},\nabstract={The paper presents two inertial viscosity-type extragradient algorithms for finding a common solution of the variational inequality problem involving a monotone and Lipschitz continuous operator and of the fixed point problem with a demicontractive mapping in real Hilbert spaces. Our algorithms use a simple step size rule which is generated by some calculations at each iteration. Two strong convergence theorems are obtained without the prior knowledge of the Lipschitz constant of the operator. The numerical behaviors of the proposed algorithms in some numerical experiments are reported and compared with previously known ones.},\nkeywords={Fixed point problem,  Inertial method,  Subgradient extragradient method,  Tseng's extragradient method,  Variational inequality problem},\nabbrev_source_title={J. Appl. Math. Comput.},\n}\n\n
\n
\n\n\n
\n The paper presents two inertial viscosity-type extragradient algorithms for finding a common solution of the variational inequality problem involving a monotone and Lipschitz continuous operator and of the fixed point problem with a demicontractive mapping in real Hilbert spaces. Our algorithms use a simple step size rule which is generated by some calculations at each iteration. Two strong convergence theorems are obtained without the prior knowledge of the Lipschitz constant of the operator. The numerical behaviors of the proposed algorithms in some numerical experiments are reported and compared with previously known ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Li, S.; and Cho, S. Y.\n\n\n \n \n \n Revisiting inertial subgradient extragradient algorithms for solving bilevel variational inequality problems.\n \n \n\n\n \n\n\n\n Journal of Applied and Numerical Optimization, 4(3): 425–444. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"RevisitingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TLC_JANO22,\nauthor={Tan, Bing and Li, Songxiao and Cho, Sun Y.},\ntitle={Revisiting inertial subgradient extragradient algorithms for solving bilevel variational inequality problems},\njournal={Journal of Applied and Numerical Optimization},\nyear={2022},\nvolume={4},\nnumber={3},\npages={425--444},\ndoi={10.23952/jano.4.2022.3.08},\nurl={https://bingtan.me/files/paper/TLC-JANO2022.pdf},\nabstract={In this paper, four modified subgradient extragradient algorithms are proposed for solving bilevel pseudomonotone variational inequality problems in real Hilbert spaces. The proposed algorithms can work adaptively without the prior knowledge of the Lipschitz constant of the pseudomonotone mapping. Strong convergence theorems for the suggested algorithms are established under suitable and mild conditions. Finally, some numerical experiments and applications are performed to verify the efficiency of the proposed algorithms with respect to some previously known ones.},\nkeywords={Inertial method, Pseudomonotone operator, Subgradient extragradient method, Bilevel variational inequality problem},\nabbrev_source_title={J. Appl. Numer. Optim.},\n}\n\n
\n
\n\n\n
\n In this paper, four modified subgradient extragradient algorithms are proposed for solving bilevel pseudomonotone variational inequality problems in real Hilbert spaces. The proposed algorithms can work adaptively without the prior knowledge of the Lipschitz constant of the pseudomonotone mapping. Strong convergence theorems for the suggested algorithms are established under suitable and mild conditions. Finally, some numerical experiments and applications are performed to verify the efficiency of the proposed algorithms with respect to some previously known ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Zhou, Z.; Tan, B.; and Li, S.\n\n\n \n \n \n Adaptive hybrid steepest descent algorithms involving an inertial extrapolation term for split monotone variational inclusion problems.\n \n \n\n\n \n\n\n\n Mathematical Methods in the Applied Sciences, 45(15): 8835–8853. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"AdaptivePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{ZTL_MMAS22,\nauthor={Zhou, Zheng and Tan, Bing and Li, Songxiao},\ntitle={Adaptive hybrid steepest descent algorithms involving an inertial extrapolation term for split monotone variational inclusion problems},\njournal={Mathematical Methods in the Applied Sciences},\nyear={2022},\nvolume={45},\nnumber={15},\npages={8835--8853},\ndoi={10.1002/mma.7931},\nurl={https://bingtan.me/files/paper/ZTL-MMAS2022.pdf},\nabstract={In this paper, we discuss the split monotone variational inclusion problem and propose two new inertial algorithms in infinite-dimensional Hilbert spaces. The iterative sequence by the proposed algorithms converges strongly to the solution of a certain variational inequality with the help of the hybrid steepest descent method. Furthermore, an adaptive step size criterion is considered in suggested algorithms to avoid the difficulty of calculating the operator norm. Meanwhile, our results are also applied to several other types of split problems. Finally, some numerical experiments show that our algorithms are realistic and summarize the known results.},\nkeywords={Adaptive stepsize,  Hybrid steepest descent method,  Inertial method,  Signal processing problem,  Strong convergence},\nabbrev_source_title={Math. Methods Appl. Sci.},\n}\n\n
\n
\n\n\n
\n In this paper, we discuss the split monotone variational inclusion problem and propose two new inertial algorithms in infinite-dimensional Hilbert spaces. The iterative sequence by the proposed algorithms converges strongly to the solution of a certain variational inequality with the help of the hybrid steepest descent method. Furthermore, an adaptive step size criterion is considered in suggested algorithms to avoid the difficulty of calculating the operator norm. Meanwhile, our results are also applied to several other types of split problems. Finally, some numerical experiments show that our algorithms are realistic and summarize the known results.\n
\n\n\n
\n\n\n
\n \n\n \n \n Zhou, Z.; Tan, B.; and Li, S.\n\n\n \n \n \n Two self-adaptive inertial projection algorithms for solving split variational inclusion problems.\n \n \n\n\n \n\n\n\n AIMS Mathematics, 7(4): 4960–4973. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"TwoPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{ZTL_AIMS22,\nauthor={Zhou, Zheng and Tan, Bing and Li, Songxiao},\ntitle={Two self-adaptive inertial projection algorithms for solving split variational inclusion problems},\njournal={AIMS Mathematics},\nyear={2022},\nvolume={7},\nnumber={4},\npages={4960--4973},\ndoi={10.3934/math.2022276},\nurl={https://bingtan.me/files/paper/ZTL-AIMS2022.pdf},\nabstract={This paper is to analyze the approximation solution of a split variational inclusion problem in the framework of Hilbert spaces. For this purpose, inertial hybrid and shrinking projection algorithms are proposed under the effect of a self-adaptive stepsize which does not require information of the norms of the given operators. The strong convergence properties of the proposed algorithms are obtained under mild constraints. Finally, a numerical experiment is given to illustrate the performance of proposed methods and to compare our algorithms with an existing algorithm.},\nkeywords={Inertial method,  Adaptive stepsize,  Split variational inclusion problem},\nabbrev_source_title={AIMS Math.},\n}\n\n
\n
\n\n\n
\n This paper is to analyze the approximation solution of a split variational inclusion problem in the framework of Hilbert spaces. For this purpose, inertial hybrid and shrinking projection algorithms are proposed under the effect of a self-adaptive stepsize which does not require information of the norms of the given operators. The strong convergence properties of the proposed algorithms are obtained under mild constraints. Finally, a numerical experiment is given to illustrate the performance of proposed methods and to compare our algorithms with an existing algorithm.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Li, S.; and Qin, X.\n\n\n \n \n \n Self-adaptive inertial single projection methods for variational inequalities involving non-Lipschitz and Lipschitz operators with their applications to optimal control problems.\n \n \n\n\n \n\n\n\n Applied Numerical Mathematics, 170: 219–241. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"Self-adaptivePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TLQ_ANM21,\nauthor={Tan, Bing and Li, Songxiao and Qin, Xiaolong},\ntitle={Self-adaptive inertial single projection methods for variational inequalities involving non-Lipschitz and Lipschitz operators with their applications to optimal control problems},\njournal={Applied Numerical Mathematics},\nyear={2021},\nvolume={170},\npages={219--241},\ndoi={10.1016/j.apnum.2021.07.022},\nurl={https://bingtan.me/files/paper/TLQ-ANM2021.pdf},\nabstract={In this paper, four accelerated subgradient extragradient methods are proposed to solve the variational inequality problem with a pseudo-monotone operator in real Hilbert spaces. These iterative schemes employ two new adaptive stepsize strategies that are significant when the Lipschitz constant of the mapping involved is unknown. Strong convergence theorems for the proposed algorithms are established under the condition that the operators are Lipschitz continuous and non-Lipschitz continuous. Numerical experiments on finite- and infinite-dimensional spaces and applications in optimal control problems are reported to demonstrate the advantages and efficiency of the proposed algorithms over some existing results.},\nkeywords={Inertial method, Subgradient extragradient method,  Optimal control problem,  Pseudomonotone operator,  Non-Lipschitz operator,  Variational inequality problem},\nabbrev_source_title={Appl Numer Math},\n}\n\n
\n
\n\n\n
\n In this paper, four accelerated subgradient extragradient methods are proposed to solve the variational inequality problem with a pseudo-monotone operator in real Hilbert spaces. These iterative schemes employ two new adaptive stepsize strategies that are significant when the Lipschitz constant of the mapping involved is unknown. Strong convergence theorems for the proposed algorithms are established under the condition that the operators are Lipschitz continuous and non-Lipschitz continuous. Numerical experiments on finite- and infinite-dimensional spaces and applications in optimal control problems are reported to demonstrate the advantages and efficiency of the proposed algorithms over some existing results.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Li, S.; and Qin, X.\n\n\n \n \n \n An accelerated extragradient algorithm for bilevel pseudomonotone variational inequality problems with application to optimal control problems.\n \n \n\n\n \n\n\n\n Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas, 115(4): 174. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TLQ_RCSM21,\nauthor={Tan, Bing and Li, Songxiao and Qin, Xiaolong},\ntitle={An accelerated extragradient algorithm for bilevel pseudomonotone variational inequality problems with application to optimal control problems},\njournal={Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas},\nyear={2021},\nvolume={115},\nnumber={4},\ndoi={10.1007/s13398-021-01116-1},\npages={174},\nurl={https://bingtan.me/files/paper/TLQ-RACSAM2021.pdf},\nabstract={In this paper, an inertial extragradient algorithm with a new non-monotonic stepsize is proposed to solve the bilevel pseudomonotone variational inequality problem in real Hilbert spaces. The advantages of the suggested iterative algorithm are that only one projection onto the feasible set needs to be performed in each iteration and the prior knowledge of the Lipschitz constant of the mapping involved does not require to be known. The strong convergence theorem of the suggested algorithm is established under some suitable conditions. Numerical experiments are reported to illustrate the advantages and efficiency of the presented algorithm over the existing related ones.},\nkeywords={Bilevel variational inequality problem,  Hybrid steepest descent method,  Inertial extragradient method,  Projection and contraction method,  Pseudomonotone operator},\nabbrev_source_title={Rev. R. Acad. Cienc. Exactas F{\\' i}s. Nat. Ser. A Mat. RACSAM},\n}\n\n
\n
\n\n\n
\n In this paper, an inertial extragradient algorithm with a new non-monotonic stepsize is proposed to solve the bilevel pseudomonotone variational inequality problem in real Hilbert spaces. The advantages of the suggested iterative algorithm are that only one projection onto the feasible set needs to be performed in each iteration and the prior knowledge of the Lipschitz constant of the mapping involved does not require to be known. The strong convergence theorem of the suggested algorithm is established under some suitable conditions. Numerical experiments are reported to illustrate the advantages and efficiency of the presented algorithm over the existing related ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Li, S.; and Qin, X.\n\n\n \n \n \n On modified subgradient extragradient methods for pseudomonotone variational inequality problems with applications.\n \n \n\n\n \n\n\n\n Computational and Applied Mathematics, 40(7): 253. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TLQ_COAM21,\nauthor={Tan, Bing and Li, Songxiao and Qin, Xiaolong},\ntitle={On modified subgradient extragradient methods for pseudomonotone variational inequality problems with applications},\njournal={Computational and Applied Mathematics},\nyear={2021},\nvolume={40},\nnumber={7},\ndoi={10.1007/s40314-021-01642-z},\npages={253},\nurl={https://bingtan.me/files/paper/TLQ-COAM2021.pdf},\nabstract={This paper presents several modified subgradient extragradient methods with inertial effects to approximate solutions of variational inequality problems in real Hilbert spaces. The operators involved are either pseudomonotone Lipschitz continuous or pseudomonotone non-Lipschitz continuous. The advantage of the suggested algorithms is that they can work adaptively without the prior information of the Lipschitz constant of the mapping involved. Strong convergence theorems of the proposed algorithms are established under some suitable conditions. Finally, some numerical experiments are given to verify the advantages and efficiency of the proposed iterative algorithms with respect to previously known ones.},\nkeywords={Extragradient method,  Non-Lipschitz operator,  Optimal control problem,  Pseudomonotone operator,  Variational inequality problem},\nabbrev_source_title={Comput. Appl. Math.},\n}\n\n
\n
\n\n\n
\n This paper presents several modified subgradient extragradient methods with inertial effects to approximate solutions of variational inequality problems in real Hilbert spaces. The operators involved are either pseudomonotone Lipschitz continuous or pseudomonotone non-Lipschitz continuous. The advantage of the suggested algorithms is that they can work adaptively without the prior information of the Lipschitz constant of the mapping involved. Strong convergence theorems of the proposed algorithms are established under some suitable conditions. Finally, some numerical experiments are given to verify the advantages and efficiency of the proposed iterative algorithms with respect to previously known ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Fan, J.; and Li, S.\n\n\n \n \n \n Self-adaptive inertial extragradient algorithms for solving variational inequality problems.\n \n \n\n\n \n\n\n\n Computational and Applied Mathematics, 40(1): 19. 2021.\n \n\n(ESI Highly Cited Paper)\n\n
\n\n\n\n \n \n \"Self-adaptivePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TFL_COAM21,\nauthor={Tan, Bing and Fan, Jingjing and Li, Songxiao},\ntitle={Self-adaptive inertial extragradient algorithms for solving variational inequality problems},\njournal={Computational and Applied Mathematics},\nyear={2021},\nvolume={40},\nnumber={1},\ndoi={10.1007/s40314-020-01393-3},\npages={19},\nurl={https://bingtan.me/files/paper/TFL-COAM2021.pdf},\nabstract={In this paper, we study the strong convergence of two Mann-type inertial extragradient algorithms, which are devised with a new step size, for solving a variational inequality problem with a monotone and Lipschitz continuous operator in real Hilbert spaces. Strong convergence theorems for the suggested algorithms are proved without the prior knowledge of the Lipschitz constant of the operator. Finally, we provide some numerical experiments to illustrate the performance of the proposed algorithms and provide a comparison with related ones.},\nkeywords={Inertial method,  Mann method,  Subgradient extragradient method,  Tseng's extragradient method,  Variational inequality problem},\nabbrev_source_title={Comput. Appl. Math.},\nbibbase_note={<span style="color: red">(<s>ESI Highly Cited Paper</s>)</span>},\n}\n\n
\n
\n\n\n
\n In this paper, we study the strong convergence of two Mann-type inertial extragradient algorithms, which are devised with a new step size, for solving a variational inequality problem with a monotone and Lipschitz continuous operator in real Hilbert spaces. Strong convergence theorems for the suggested algorithms are proved without the prior knowledge of the Lipschitz constant of the operator. Finally, we provide some numerical experiments to illustrate the performance of the proposed algorithms and provide a comparison with related ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Zhou, Z.; Tan, B.; and Li, S.\n\n\n \n \n \n An accelerated hybrid projection method with a self-adaptive step-size sequence for solving split common fixed point problems.\n \n \n\n\n \n\n\n\n Mathematical Methods in the Applied Sciences, 44(8): 7294–7303. 2021.\n \n\n(ESI Highly Cited Paper)\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{ZTL_MMAS21,\nauthor={Zhou, Zheng and Tan, Bing and Li, Songxiao},\ntitle={An accelerated hybrid projection method with a self-adaptive step-size sequence for solving split common fixed point problems},\njournal={Mathematical Methods in the Applied Sciences},\nyear={2021},\nvolume={44},\nnumber={8},\npages={7294--7303},\ndoi={10.1002/mma.7261},\nurl={https://bingtan.me/files/paper/ZTL-MMAS2021.pdf},\nabstract={This paper attempts to solve the split common fixed point problem for demicontractive mappings. We give an accelerated hybrid projection algorithm that combines the hybrid projection method and the inertial technique. The strong convergence theorem of this algorithm is obtained under mild conditions by a self-adaptive step-size sequence, which does not need prior knowledge of the operator norm. Some numerical experiments in infinite-dimensional Hilbert spaces are provided to illustrate the reliability and robustness of the algorithm and also to compare it with existing ones.},\nkeywords={Demicontractive mapping,  Hybrid projection method,  Inertial method,  Split common fixed point problem},\nabbrev_source_title={Math. Methods Appl. Sci.},\nbibbase_note={<span style="color: red">(<s>ESI Highly Cited Paper</s>)</span>},\n}\n\n
\n
\n\n\n
\n This paper attempts to solve the split common fixed point problem for demicontractive mappings. We give an accelerated hybrid projection algorithm that combines the hybrid projection method and the inertial technique. The strong convergence theorem of this algorithm is obtained under mild conditions by a self-adaptive step-size sequence, which does not need prior knowledge of the operator norm. Some numerical experiments in infinite-dimensional Hilbert spaces are provided to illustrate the reliability and robustness of the algorithm and also to compare it with existing ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Fan, J.; Tan, B.; and Li, S.\n\n\n \n \n \n An explicit extragradient algorithm for equilibrium problems on HHadamard manifolds.\n \n \n\n\n \n\n\n\n Computational and Applied Mathematics, 40(2): 68. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{FTL_COAM21,\nauthor={Fan, Jingjing and Tan, Bing and Li, Songxiao},\ntitle={An explicit extragradient algorithm for equilibrium problems on {H}{H}adamard manifolds},\njournal={Computational and Applied Mathematics},\nyear={2021},\nvolume={40},\nnumber={2},\ndoi={10.1007/s40314-021-01427-4},\npages={68},\nurl={https://bingtan.me/files/paper/FTL-COAM2021.pdf},\nabstract={In this paper, we investigate a new extragradient algorithm for solving pseudomonotone equilibrium problems on Hadamard manifolds. Our algorithm uses a variable stepsize, which is updated at each iteration and based on some previous iterates. The convergence analysis of the proposed algorithm is discussed under mild assumptions. In the case where the equilibrium bifunction is strongly pseudomonotone, the R-linear rate of convergence of the new algorithm is formulated. A fundamental experiment is provided to illustrate the numerical behavior of the algorithm.},\nkeywords={Equilibrium problem,  Extragradient method,  Hadamard manifolds,  Lipschitz-type bifunction,  Pseudomonotone bifunction},\nabbrev_source_title={Comput. Appl. Math.},\n}\n\n
\n
\n\n\n
\n In this paper, we investigate a new extragradient algorithm for solving pseudomonotone equilibrium problems on Hadamard manifolds. Our algorithm uses a variable stepsize, which is updated at each iteration and based on some previous iterates. The convergence analysis of the proposed algorithm is discussed under mild assumptions. In the case where the equilibrium bifunction is strongly pseudomonotone, the R-linear rate of convergence of the new algorithm is formulated. A fundamental experiment is provided to illustrate the numerical behavior of the algorithm.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Li, S.\n\n\n \n \n \n Strong convergence of inertial mann algorithms for solving hierarchical fixed point problems.\n \n \n\n\n \n\n\n\n Journal of Nonlinear and Variational Analysis, 4(3): 337–355. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"StrongPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TL_JNVA20,\nauthor={Tan, Bing and Li, Songxiao},\ntitle={Strong convergence of inertial mann algorithms for solving hierarchical fixed point problems},\njournal={Journal of Nonlinear and Variational Analysis},\nyear={2020},\nvolume={4},\nnumber={3},\npages={337--355},\ndoi={10.23952/jnva.4.2020.3.02},\nurl={https://bingtan.me/files/paper/TL-JNVA2020.pdf},\nabstract={The paper introduces two inertial Mann algorithms to find solutions of hierarchical fixed point problems of nonexpansive mappings. We obtain strong convergence theorems in Hilbert spaces under suitable conditions. Some numerical examples are provided to illustrate the numerical behavior of the algorithms and numerical results show that our proposed algorithms are efficient and robust.},\nkeywords={Hierarchical fixed point problem,  Inertial method, Mann method,  Nonexpansive mapping,  Strong convergence,  Viscosity method},\nabbrev_source_title={J. Nonlinear Var. Anal.},\n}\n\n
\n
\n\n\n
\n The paper introduces two inertial Mann algorithms to find solutions of hierarchical fixed point problems of nonexpansive mappings. We obtain strong convergence theorems in Hilbert spaces under suitable conditions. Some numerical examples are provided to illustrate the numerical behavior of the algorithms and numerical results show that our proposed algorithms are efficient and robust.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Xu, S.; and Li, S.\n\n\n \n \n \n Inertial shrinking projection algorithms for solving hierarchical variational inequality problems.\n \n \n\n\n \n\n\n\n Journal of Nonlinear and Convex Analysis, 21(4): 871–884. 2020.\n \n\n(ESI Highly Cited Paper)\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TXL_JNCA20_2,\nauthor={Tan, Bing and Xu, Shanshan and Li, Songxiao},\ntitle={Inertial shrinking projection algorithms for solving hierarchical variational inequality problems},\njournal={Journal of Nonlinear and Convex Analysis},\nyear={2020},\nvolume={21},\nnumber={4},\npages={871--884},\nurl={https://bingtan.me/files/paper/TXL-JNCA2020.pdf},\nabstract={In this paper, we propose two inertial shrinking algorithms to approximate a solution of hierarchical variational inequality problems with nonex-pansive mappings in Hilbert spaces. We prove strong convergence theorems under some mild conditions. Finally, we present some numerical examples to compare our algorithms with some existing algorithms, which illustrate the advantage of our proposed algorithms.},\nkeywords={Hierarchical variational inequality problem,  Inertial method, Mann method,  Nonexpansive mapping,  Shrinking projection method,  Strong convergence},\nabbrev_source_title={J. Nonlinear Convex Anal.},\nbibbase_note={<span style="color: red">(<s>ESI Highly Cited Paper</s>)</span>},\n}\n\n
\n
\n\n\n
\n In this paper, we propose two inertial shrinking algorithms to approximate a solution of hierarchical variational inequality problems with nonex-pansive mappings in Hilbert spaces. We prove strong convergence theorems under some mild conditions. Finally, we present some numerical examples to compare our algorithms with some existing algorithms, which illustrate the advantage of our proposed algorithms.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Xu, S.; and Li, S.\n\n\n \n \n \n Inertial hybrid and shrinking projection algorithms for solving variational inequality problems.\n \n \n\n\n \n\n\n\n Journal of Nonlinear and Convex Analysis, 21(10): 2193–2206. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TXL_JNCA20_1,\nauthor={Tan, Bing and Xu, Shanshan and Li, Songxiao},\ntitle={Inertial hybrid and shrinking projection algorithms for solving variational inequality problems},\njournal={Journal of Nonlinear and Convex Analysis},\nyear={2020},\nvolume={21},\nnumber={10},\npages={2193--2206},\nurl={https://bingtan.me/files/paper/TXL-JNCA2020-10.pdf},\nabstract={In this paper, we propose two inertial hybrid and shrinking projection algorithms for strict pseudo-contractions in Hilbert spaces and obtain strong theorems in general conditions. In addition, we also propose two new inertial hybrid and shrinking projection algorithms without extrapolating step for non-expansive mappings in Hilbert spaces and get strong convergence results. Finally, we give some numerical examples to illustrate the computational performance of our proposed algorithms.},\nkeywords={Variational inequality problem,  Inertial method, Hybrid projection method, Shrinking projection method, Strong convergence},\nabbrev_source_title={J. Nonlinear Convex Anal.},\n}\n\n
\n
\n\n\n
\n In this paper, we propose two inertial hybrid and shrinking projection algorithms for strict pseudo-contractions in Hilbert spaces and obtain strong theorems in general conditions. In addition, we also propose two new inertial hybrid and shrinking projection algorithms without extrapolating step for non-expansive mappings in Hilbert spaces and get strong convergence results. Finally, we give some numerical examples to illustrate the computational performance of our proposed algorithms.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Xu, S.; and Li, S.\n\n\n \n \n \n Modified inertial hybrid and shrinking projection algorithms for solving fixed point problems.\n \n \n\n\n \n\n\n\n Mathematics, 8(2): 236. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"ModifiedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TXL_MATH20,\nauthor={Tan, Bing and Xu, Shanshan and Li, Songxiao},\ntitle={Modified inertial hybrid and shrinking projection algorithms for solving fixed point problems},\njournal={Mathematics},\nyear={2020},\nvolume={8},\nnumber={2},\ndoi={10.3390/math8020236},\npages={236},\nurl={https://bingtan.me/files/paper/TXL-Math2020.pdf},\nabstract={In this paper, we introduce two modified inertial hybrid and shrinking projection algorithms for solving fixed point problems by combining the modified inertial Mann algorithm with the projection algorithm. We establish strong convergence theorems under certain suitable conditions. Finally, our algorithms are applied to convex feasibility problem, variational inequality problem, and location theory. The algorithms and results presented in this paper can summarize and unify corresponding results previously known in this field.},\nkeywords={Conjugate gradient method,  Hybrid projection method,  Inertial method,  Nonexpansive mapping,  Shrinking projection method,  Hybrid steepest descent method,  Strong convergence},\nabbrev_source_title={Mathematics},\n}\n\n
\n
\n\n\n
\n In this paper, we introduce two modified inertial hybrid and shrinking projection algorithms for solving fixed point problems by combining the modified inertial Mann algorithm with the projection algorithm. We establish strong convergence theorems under certain suitable conditions. Finally, our algorithms are applied to convex feasibility problem, variational inequality problem, and location theory. The algorithms and results presented in this paper can summarize and unify corresponding results previously known in this field.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Zhou, Z.; and Li, S.\n\n\n \n \n \n Strong convergence of modified inertial mann algorithms for nonexpansive mappings.\n \n \n\n\n \n\n\n\n Mathematics, 8(4): 462. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"StrongPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TZL_MATH20,\nauthor={Tan, Bing and Zhou, Zheng and Li, Songxiao},\ntitle={Strong convergence of modified inertial mann algorithms for nonexpansive mappings},\njournal={Mathematics},\nyear={2020},\nvolume={8},\nnumber={4},\ndoi={10.3390/math8040462},\npages={462},\nurl={https://bingtan.me/files/paper/TZL-Math2020.pdf},\nabstract={We investigated two new modified inertial Mann Halpern and inertial Mann viscosity algorithms for solving fixed point problems. Strong convergence theorems under some fewer restricted conditions are established in the framework of infinite dimensional Hilbert spaces. Finally, some numerical examples are provided to support our main results. The algorithms and results presented in this paper can generalize and extend corresponding results previously known in the literature.},\nkeywords={Halpern method,  Inertial method,  Nonexpansive mapping,  Strong convergence,  Viscosity method},\nabbrev_source_title={Mathematics},\n}\n\n
\n
\n\n\n
\n We investigated two new modified inertial Mann Halpern and inertial Mann viscosity algorithms for solving fixed point problems. Strong convergence theorems under some fewer restricted conditions are established in the framework of infinite dimensional Hilbert spaces. Finally, some numerical examples are provided to support our main results. The algorithms and results presented in this paper can generalize and extend corresponding results previously known in the literature.\n
\n\n\n
\n\n\n
\n \n\n \n \n Zhou, Z.; Tan, B.; and Li, S.\n\n\n \n \n \n A new accelerated self-adaptive stepsize algorithm with excellent stability for split common fixed point problems.\n \n \n\n\n \n\n\n\n Computational and Applied Mathematics, 39(3): 220. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{ZTL_COAM20,\nauthor={Zhou, Zheng and Tan, Bing and Li, Songxiao},\ntitle={A new accelerated self-adaptive stepsize algorithm with excellent stability for split common fixed point problems},\njournal={Computational and Applied Mathematics},\nyear={2020},\nvolume={39},\nnumber={3},\ndoi={10.1007/s40314-020-01237-0},\npages={220},\nurl={https://bingtan.me/files/paper/ZTL-COAM2020.pdf},\nabstract={In the framework of Hilbert spaces, we study the solutions of split common fixed point problems. A new accelerated self-adaptive stepsize algorithm with excellent stability is proposed under the effects of inertial techniques and Meir–Keeler contraction mappings. The strong convergence theorems are obtained without prior knowledge of operator norms. Finally, in applications, our main results in this paper are applied to signal recovery problems.},\nkeywords={Inertial method,  Meir–Keeler contraction,  Adaptive stepsize,  Signal processing problem, Split common fixed point problem},\nabbrev_source_title={Comput. Appl. Math.},\n}\n\n
\n
\n\n\n
\n In the framework of Hilbert spaces, we study the solutions of split common fixed point problems. A new accelerated self-adaptive stepsize algorithm with excellent stability is proposed under the effects of inertial techniques and Meir–Keeler contraction mappings. The strong convergence theorems are obtained without prior knowledge of operator norms. Finally, in applications, our main results in this paper are applied to signal recovery problems.\n
\n\n\n
\n\n\n
\n \n\n \n \n Zhou, Z.; Tan, B.; and Li, S.\n\n\n \n \n \n An inertial shrinking projection algorithm for split common fixed point problems.\n \n \n\n\n \n\n\n\n Journal of Applied Analysis and Computation, 10(5): 2104–2120. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{ZTL_JAAC20,\nauthor={Zhou, Zheng and Tan, Bing and Li, Songxiao},\ntitle={An inertial shrinking projection algorithm for split common fixed point problems},\njournal={Journal of Applied Analysis and Computation},\nyear={2020},\nvolume={10},\nnumber={5},\npages={2104--2120},\ndoi={10.11948/20190330},\nurl={https://bingtan.me/files/paper/ZTL-JAAC2020.pdf},\nabstract={In this paper, the purpose is to introduce and study a new modified shrinking projection algorithm with inertial effects, which solves split common fixed point problems in Banach spaces. The corresponding strong convergence theorems are obtained without the assumption of semi-compactness on map-pings. Finally, some numerical examples are presented to illustrate the results in this paper.},\nkeywords={Inertial method,  Shrinking projection method,  Split common fixed point problem,  Strong convergence},\nabbrev_source_title={J. Appl. Anal. Comput.},\n}\n\n
\n
\n\n\n
\n In this paper, the purpose is to introduce and study a new modified shrinking projection algorithm with inertial effects, which solves split common fixed point problems in Banach spaces. The corresponding strong convergence theorems are obtained without the assumption of semi-compactness on map-pings. Finally, some numerical examples are presented to illustrate the results in this paper.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n Liu, L.\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n Tan, B.; Liu, L.; and Qin, X.\n\n\n \n \n \n Strong convergence of inertial extragradient algorithms for solving variational inequalities and fixed point problems.\n \n \n\n\n \n\n\n\n Fixed Point Theory, 23(2): 707–728. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"StrongPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TLQ_FPT22,\nauthor={Tan, Bing and Liu, Liya and Qin, Xiaolong},\ntitle={Strong convergence of inertial extragradient algorithms for solving variational inequalities and fixed point problems},\njournal={Fixed Point Theory},\nyear={2022},\nvolume={23},\nnumber={2},\npages={707--728},\ndoi={10.24193/fpt-ro.2022.2.17},\nurl={https://bingtan.me/files/paper/TLQ-FPT2022.pdf},\nabstract={This paper investigates two inertial extragradient algorithms for seeking a common solution to a variational inequality problem involving a monotone and Lipschitz continuous mapping and a fixed point problem with a demicontractive mapping in real Hilbert spaces. Our algorithms need to calculate the projection on the feasible set only once in each iteration. Moreover, they can work well without the prior information of the Lipschitz constant of the operator and do not contain any linesearch process. Strong convergence theorems of the suggested algorithms are established under suitable conditions. Some experiments are presented to illustrate the numerical efficiency of the suggested algorithms and compare them with some existing ones.},\nkeywords={Variational inequality problem, Fixed point problem, Subgradient extragradient method, Tseng's extragradient method, Inertial method, Demicontractive mapping},\nabbrev_source_title={Fixed Point Theory},\n}\n\n
\n
\n\n\n
\n This paper investigates two inertial extragradient algorithms for seeking a common solution to a variational inequality problem involving a monotone and Lipschitz continuous mapping and a fixed point problem with a demicontractive mapping in real Hilbert spaces. Our algorithms need to calculate the projection on the feasible set only once in each iteration. Moreover, they can work well without the prior information of the Lipschitz constant of the operator and do not contain any linesearch process. Strong convergence theorems of the suggested algorithms are established under suitable conditions. Some experiments are presented to illustrate the numerical efficiency of the suggested algorithms and compare them with some existing ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Liu, L.; and Qin, X.\n\n\n \n \n \n Self adaptive inertial extragradient algorithms for solving bilevel pseudomonotone variational inequality problems.\n \n \n\n\n \n\n\n\n Japan Journal of Industrial and Applied Mathematics, 38(2): 519-543. 2021.\n \n\n(ESI Highly Cited Paper)\n\n
\n\n\n\n \n \n \"SelfPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TLQ_JIAM21,\nauthor={Tan, Bing and Liu, Liya and Qin, Xiaolong},\ntitle={Self adaptive inertial extragradient algorithms for solving bilevel pseudomonotone variational inequality problems},\njournal={Japan Journal of Industrial and Applied Mathematics},\nyear={2021},\nvolume={38},\nnumber={2},\npages={519-543},\ndoi={10.1007/s13160-020-00450-y},\nurl={https://bingtan.me/files/paper/TLQ-JIAM2021.pdf},\nabstract={We introduce two inertial extragradient algorithms for solving a bilevel pseudomonotone variational inequality problem in real Hilbert spaces. The advantages of the proposed algorithms are that they can work without the prior knowledge of the Lipschitz constant of the involving operator and only one projection onto the feasible set is required. Strong convergence theorems of the suggested algorithms are obtained under suitable conditions. Finally, some numerical examples are provided to show the efficiency of the proposed algorithms.},\nkeywords={Bilevel variational inequality problem,  Inertial method, Subgradient extragradient method,  Tseng's extragradient method,  Pseudomonotone operator,  Hybrid steepest descent method},\nabbrev_source_title={Jpn J. Ind. Appl. Math.},\nbibbase_note={<span style="color: red">(<s>ESI Highly Cited Paper</s>)</span>},\n}\n\n
\n
\n\n\n
\n We introduce two inertial extragradient algorithms for solving a bilevel pseudomonotone variational inequality problem in real Hilbert spaces. The advantages of the proposed algorithms are that they can work without the prior knowledge of the Lipschitz constant of the involving operator and only one projection onto the feasible set is required. Strong convergence theorems of the suggested algorithms are obtained under suitable conditions. Finally, some numerical examples are provided to show the efficiency of the proposed algorithms.\n
\n\n\n
\n\n\n
\n \n\n \n \n Liu, L.; Tan, B.; and Latif, A.\n\n\n \n \n \n Approximation of fixed points for a semigroup of Bregman quasi-nonexpansive mappings in Banach spaces.\n \n \n\n\n \n\n\n\n Journal of Nonlinear and Variational Analysis, 5(1): 9–22. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"ApproximationPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{LTL_JNVA21,\nauthor={Liu, Liya and Tan, Bing and Latif, A.},\ntitle={Approximation of fixed points for a semigroup of Bregman quasi-nonexpansive mappings in {B}anach spaces},\njournal={Journal of Nonlinear and Variational Analysis},\nyear={2021},\nvolume={5},\nnumber={1},\npages={9--22},\ndoi={10.23952/jnva.5.2021.1.02},\nurl={https://bingtan.me/files/paper/LTL-JNVA2021.pdf},\nabstract={The purpose of this paper is to study the iterative scheme of the Halpern type for a commutative semigroup $\\mathfrak{J}=\\left\\{S_{\\lambda}: \\lambda \\in \\mathcal{Q}\\right\\}$ of Bregman quasi-nonexpansive mappings on a closed and convex subset of a Banach space. A strong convergence theorem is established for finding a common fixed point solution. Our results extend and improve some related results in the current literature. In addition, we present numerical examples to illustrate the performance of our method in finite and infinite dimensional spaces.},\nkeywords={Banach space,  Bregman quasi-nonexpansive,  Fixed point problem,  Halpern method,  Strong convergence},\nabbrev_source_title={J. Nonlinear Var. Anal.},\n}\n\n
\n
\n\n\n
\n The purpose of this paper is to study the iterative scheme of the Halpern type for a commutative semigroup $\\mathfrak{J}=łeft\\{S_{λ}: λ ∈ \\mathcal{Q}i̊ght\\}$ of Bregman quasi-nonexpansive mappings on a closed and convex subset of a Banach space. A strong convergence theorem is established for finding a common fixed point solution. Our results extend and improve some related results in the current literature. In addition, we present numerical examples to illustrate the performance of our method in finite and infinite dimensional spaces.\n
\n\n\n
\n\n\n
\n \n\n \n \n Liu, L.; Tan, B.; and Cho, S. Y.\n\n\n \n \n \n On the resolution of variational inequality problems with a double-hierarchical structure.\n \n \n\n\n \n\n\n\n Journal of Nonlinear and Convex Analysis, 21(2): 377–386. 2020.\n \n\n(ESI Highly Cited Paper)\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{LTC_JNCA20,\nauthor={Liu, Liya and Tan, Bing and Cho, Sun Y.},\ntitle={On the resolution of variational inequality problems with a double-hierarchical structure},\njournal={Journal of Nonlinear and Convex Analysis},\nyear={2020},\nvolume={21},\nnumber={2},\npages={377--386},\nurl={https://bingtan.me/files/paper/LTC-JNCA2020.pdf},\nabstract={In this paper, we discuss a pseudo-monotone variational inequality problem with a variational inequality constraint over a general, nonempty, closed and convex set, which is called the double-hierarchical constrained optimization problem. In addition, we propose an iterative algorithm by incorporating inertial terms in the extragradient algorithm. Strong convergence of the algorithm to the unique solution of the problem is guaranteed under certain assumptions.},\nkeywords={Constrained optimization problem,  Inertial method, Pseudomonotone operator,  Variational inequality problem},\nabbrev_source_title={J. Nonlinear Convex Anal.},\nbibbase_note={<span style="color: red">(ESI Highly Cited Paper)</span>},\n}\n\n
\n
\n\n\n
\n In this paper, we discuss a pseudo-monotone variational inequality problem with a variational inequality constraint over a general, nonempty, closed and convex set, which is called the double-hierarchical constrained optimization problem. In addition, we propose an iterative algorithm by incorporating inertial terms in the extragradient algorithm. Strong convergence of the algorithm to the unique solution of the problem is guaranteed under certain assumptions.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n Luo, Y.\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n Luo, Y.; Tan, B.; and Li, S.\n\n\n \n \n \n Inertial splitting algorithms for nonlinear operators of pseudocontractive and accretive types.\n \n \n\n\n \n\n\n\n Optimization, 72(3): 647–675. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{LTL_OPT23,\nauthor={Luo, Yinglin and Tan, Bing and Li, Songxiao},\ntitle={Inertial splitting algorithms for nonlinear operators of pseudocontractive and accretive types},\njournal={Optimization},\nyear={2023},\nvolume={72},\nnumber={3},\npages={647--675},\ndoi={10.1080/02331934.2021.1981896},\nurl={https://bingtan.me/files/paper/LTL-OPT2023.pdf},\nabstract={In this paper, inertial splitting algorithms for nonlinear operators of pseudocontractive and accretive types are proposed. Weak and strong convergence theorems are established in uniformly convex and $q$-uniformly smooth Banach spaces. Numerical examples are given to illustrate the effectiveness of our proposed algorithms.},\nkeywords={Accretive operator,  Banach space,  Inertial method,  Strict pseudo-contraction,  Strong convergence},\nabbrev_source_title={Optimization},\n}\n\n
\n
\n\n\n
\n In this paper, inertial splitting algorithms for nonlinear operators of pseudocontractive and accretive types are proposed. Weak and strong convergence theorems are established in uniformly convex and $q$-uniformly smooth Banach spaces. Numerical examples are given to illustrate the effectiveness of our proposed algorithms.\n
\n\n\n
\n\n\n
\n \n\n \n \n Luo, Y.; Shang, M.; and Tan, B.\n\n\n \n \n \n A general inertial viscosity type method for nonexpansive mappings and its applications in signal processing.\n \n \n\n\n \n\n\n\n Mathematics, 8(2): 288. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{LST_MATH20,\nauthor={Luo, Yinglin and Shang, Meijuan and Tan, Bing},\ntitle={A general inertial viscosity type method for nonexpansive mappings and its applications in signal processing},\njournal={Mathematics},\nyear={2020},\nvolume={8},\nnumber={2},\ndoi={10.3390/math8020288},\npages={288},\nurl={https://bingtan.me/files/paper/LST-Math2020.pdf},\nabstract={In this paper, we propose viscosity algorithms with two different inertia parameters for solving fixed points of nonexpansive and strictly pseudocontractive mappings. Strong convergence theorems are obtained in Hilbert spaces and the applications to the signal processing are considered. Moreover, some numerical experiments of proposed algorithms and comparisons with existing algorithms are given to the demonstration of the efficiency of the proposed algorithms. The numerical results show that our algorithms are superior to some related algorithms.},\nkeywords={Inclusion problem,  Nonexpansive mapping,  Signal processing problem,  Strict pseudo-contraction,  Variational inequality problem},\nabbrev_source_title={Mathematics},\n}\n\n\n\n\n\n\n\n\n\n
\n
\n\n\n
\n In this paper, we propose viscosity algorithms with two different inertia parameters for solving fixed points of nonexpansive and strictly pseudocontractive mappings. Strong convergence theorems are obtained in Hilbert spaces and the applications to the signal processing are considered. Moreover, some numerical experiments of proposed algorithms and comparisons with existing algorithms are given to the demonstration of the efficiency of the proposed algorithms. The numerical results show that our algorithms are superior to some related algorithms.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n Petruşel, A.\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Tan, B.; Petruşel, A.; Qin, X.; and Yao, J. C.\n\n\n \n \n \n Global and linear convergence of alternated inertial single projection algorithms for pseudo-monotone variational inequalities.\n \n \n\n\n \n\n\n\n Fixed Point Theory, 23(1): 391–426. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"GlobalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TPQY_FPT22,\nauthor={Tan, Bing and Petruşel, Adrian and Qin, Xiaolong and Yao, Jen C.},\ntitle={Global and linear convergence of alternated inertial single projection algorithms for pseudo-monotone variational inequalities},\njournal={Fixed Point Theory},\nyear={2022},\nvolume={23},\nnumber={1},\npages={391--426},\ndoi={10.24193/fpt-ro.2022.1.25},\nurl={https://bingtan.me/files/paper/TPQY-FPT2022.pdf},\nabstract={In this paper, we investigate three new relaxed single projection methods with alternating inertial extrapolation steps and adaptive non-monotonic step sizes for solving pseudo-monotone variational inequalities in real Hilbert spaces. The proposed algorithms need to compute the projection on the feasible set only once in each iteration and they can work adaptively without the prior information of the Lipschitz constant of the mapping. The weak convergence theorems of the proposed iterative schemes are established under some appropriate conditions imposed on the parameters. These methods recover the Fejér monotonicity of the even subsequence with respect to the solution and obtain linear convergence rates. Finally, some numerical experiments and applications to optimal control problems are provided to demonstrate the advantages and efficiency of the proposed methods compared to some recent related ones.},\nkeywords={Adaptive stepsize,  Alternated inertial method,  Projection and contraction method,  Pseudomonotone operator,  Subgradient extragradient method,  Variational inequality problem},\nabbrev_source_title={Fixed Point Theory},\n}\n\n
\n
\n\n\n
\n In this paper, we investigate three new relaxed single projection methods with alternating inertial extrapolation steps and adaptive non-monotonic step sizes for solving pseudo-monotone variational inequalities in real Hilbert spaces. The proposed algorithms need to compute the projection on the feasible set only once in each iteration and they can work adaptively without the prior information of the Lipschitz constant of the mapping. The weak convergence theorems of the proposed iterative schemes are established under some appropriate conditions imposed on the parameters. These methods recover the Fejér monotonicity of the even subsequence with respect to the solution and obtain linear convergence rates. Finally, some numerical experiments and applications to optimal control problems are provided to demonstrate the advantages and efficiency of the proposed methods compared to some recent related ones.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n Qin, X.\n \n \n (20)\n \n \n
\n
\n \n \n
\n \n\n \n \n Tan, B.; Qin, X.; and Wang, X.\n\n\n \n \n \n Alternated inertial algorithms for split feasibility problems.\n \n \n\n\n \n\n\n\n Numerical Algorithms, 95(2): 773–812. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"AlternatedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TQW_NUMA24,\nauthor={Tan, Bing and Qin, Xiaolong and Wang, Xianfu},\ntitle={Alternated inertial algorithms for split feasibility problems},\njournal={Numerical Algorithms},\nyear={2024},\nvolume={95},\nnumber={2},\npages={773--812},\ndoi={10.1007/s11075-023-01589-8},\nurl={https://bingtan.me/files/paper/TQW-NUMA2024.pdf},\nabstract={We introduce four novel relaxed CQ algorithms with alternating inertial for solving split feasibility problems in real Hilbert spaces. The proposed algorithms employ a new non-monotonic adaptive step size criterion and utilize two different step sizes in each iteration. The weak convergence of the iterative sequences generated by the proposed algorithms is established under some weak conditions. Moreover, the Fejér monotonicity of the even subsequence with respect to the solution set is recovered. Two applications in signal denoising and image deblurring are given to illustrate the computational efficiency of our algorithms.},\nkeywords={Split feasibility problem,  CQ method,  Projection and contraction method,  Alternated inertial method,  Signal processing,  Image restoration},\nabbrev_source_title={Numer. Algorithms},\n}\n\n
\n
\n\n\n
\n We introduce four novel relaxed CQ algorithms with alternating inertial for solving split feasibility problems in real Hilbert spaces. The proposed algorithms employ a new non-monotonic adaptive step size criterion and utilize two different step sizes in each iteration. The weak convergence of the iterative sequences generated by the proposed algorithms is established under some weak conditions. Moreover, the Fejér monotonicity of the even subsequence with respect to the solution set is recovered. Two applications in signal denoising and image deblurring are given to illustrate the computational efficiency of our algorithms.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Qin, X.\n\n\n \n \n \n An alternated inertial algorithm with weak and linear convergence for solving monotone inclusions.\n \n \n\n\n \n\n\n\n Annals of Mathematical Sciences and Applications, 8(2): 321–345. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TQ_AMSA23,\nauthor={Tan, Bing and Qin, Xiaolong},\ntitle={An alternated inertial algorithm with weak and linear convergence for solving monotone inclusions},\njournal={Annals of Mathematical Sciences and Applications},\nyear={2023},\nvolume={8},\nnumber={2},\npages={321--345},\ndoi={10.4310/AMSA.2023.v8.n2.a7},\nurl={https://bingtan.me/files/paper/TQ-AMSA2023.pdf},\nabstract={Inertial-based methods have the drawback of not preserving the Fejér monotonicity of iterative sequences, which may result in slower convergence compared to their corresponding non-inertial versions. To overcome this issue, Mu and Peng [Stat. Optim. Inf. Comput. 3 (2015), 241–248; MR3393305] suggested an alternating inertial method that can recover the Fejér monotonicity of even subsequences. In this paper, we propose a modified version of the forward-backward algorithm with alternating inertial and relaxation effects to solve an inclusion problem in real Hilbert spaces. The weak and linear convergence of the presented algorithm is established under suitable and mild conditions on the involved operators and parameters. Furthermore, the Fejér monotonicity of even subsequences generated by the proposed algorithm with respect to the solution set is recovered. Finally, our tests on image restoration problems demonstrate the superiority of the proposed algorithm over some related results.},\nkeywords={Inclusion problems, Alternated inertial, Forward-backward method, Tseng's method, Projection and contraction method, Linear convergence},\nabbrev_source_title={Ann. Math. Sci. Appl.},\n}\n\n
\n
\n\n\n
\n Inertial-based methods have the drawback of not preserving the Fejér monotonicity of iterative sequences, which may result in slower convergence compared to their corresponding non-inertial versions. To overcome this issue, Mu and Peng [Stat. Optim. Inf. Comput. 3 (2015), 241–248; MR3393305] suggested an alternating inertial method that can recover the Fejér monotonicity of even subsequences. In this paper, we propose a modified version of the forward-backward algorithm with alternating inertial and relaxation effects to solve an inclusion problem in real Hilbert spaces. The weak and linear convergence of the presented algorithm is established under suitable and mild conditions on the involved operators and parameters. Furthermore, the Fejér monotonicity of even subsequences generated by the proposed algorithm with respect to the solution set is recovered. Finally, our tests on image restoration problems demonstrate the superiority of the proposed algorithm over some related results.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Qin, X.; and Gibali, A.\n\n\n \n \n \n Three approximation methods for solving constraint variational inequalities and related problems.\n \n \n\n\n \n\n\n\n Pure and Applied Functional Analysis, 8(3): 965–986. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"ThreePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TGQ_PAFA23,\nauthor={Tan, Bing and Qin, Xiaolong and Gibali, Aviv},\ntitle={Three approximation methods for solving constraint variational inequalities and related problems},\njournal={Pure and Applied Functional Analysis},\nyear={2023},\nvolume={8},\nnumber={3},\npages={965--986},\nurl={https://bingtan.me/files/paper/TGQ_PAFA2023.pdf},\nabstract={In this paper, we present three new self-adaptive one-projection algorithms to find common solutions for the pseudo-monotone variational inequality problem and the fixed point problem of a demi-contractive mapping. Note that the suggested approaches use a non-monotonic self-adaptive step size so that they can work well without knowing the prior knowledge of the Lipschitz constant of the mapping. Strong convergence theorems of the proposed iterative schemes are established in real Hilbert spaces. Several mathematical experiments are reported to demonstrate the numerical behavior of the suggested algorithms and compare them with the existing ones. Finally, the suggested methods are used to solve optimal control problems.},\nkeywords={Variational inequality, Fixed point, Extragradient method, Hybrid steepest descent method, Pseudomonotone mapping},\nabbrev_source_title={Pure Appl. Funct. Anal.},\n}\n\n
\n
\n\n\n
\n In this paper, we present three new self-adaptive one-projection algorithms to find common solutions for the pseudo-monotone variational inequality problem and the fixed point problem of a demi-contractive mapping. Note that the suggested approaches use a non-monotonic self-adaptive step size so that they can work well without knowing the prior knowledge of the Lipschitz constant of the mapping. Strong convergence theorems of the proposed iterative schemes are established in real Hilbert spaces. Several mathematical experiments are reported to demonstrate the numerical behavior of the suggested algorithms and compare them with the existing ones. Finally, the suggested methods are used to solve optimal control problems.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Qin, X.; and Cho, S. Y.\n\n\n \n \n \n Revisiting subgradient extragradient methods for solving variational inequalities.\n \n \n\n\n \n\n\n\n Numerical Algorithms, 90(4): 1593–1615. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"RevisitingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TQC_NUMA22,\nauthor={Tan, Bing and Qin, Xiaolong and Cho, Sun Y.},\ntitle={Revisiting subgradient extragradient methods for solving variational inequalities},\njournal={Numerical Algorithms},\nyear={2022},\nvolume={90},\nnumber={4},\npages={1593--1615},\ndoi={10.1007/s11075-021-01243-1},\nurl={https://bingtan.me/files/paper/TQC-NUMA2022.pdf},\nabstract={In this paper, several extragradient algorithms with inertial effects and adaptive non-monotonic step sizes are proposed to solve pseudomonotone variational inequalities in real Hilbert spaces. The strong convergence of the proposed methods is established without the prior knowledge of the Lipschitz constant of the mapping. Some numerical experiments are given to illustrate the advantages and efficiency of the proposed schemes over previously known ones.},\nkeywords={Armijo stepsize,  Inertial extragradient method,  Non-Lipschitz operator,  Pseudomonotone operator,  Variational inequality problem},\nabbrev_source_title={Numer. Algorithms},\n}\n\n
\n
\n\n\n
\n In this paper, several extragradient algorithms with inertial effects and adaptive non-monotonic step sizes are proposed to solve pseudomonotone variational inequalities in real Hilbert spaces. The strong convergence of the proposed methods is established without the prior knowledge of the Lipschitz constant of the mapping. Some numerical experiments are given to illustrate the advantages and efficiency of the proposed schemes over previously known ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Qin, X.; and Yao, J. C.\n\n\n \n \n \n Strong convergence of inertial projection and contraction methods for pseudomonotone variational inequalities with applications to optimal control problems.\n \n \n\n\n \n\n\n\n Journal of Global Optimization, 82(3): 523–557. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"StrongPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TQY_JOGO22,\nauthor={Tan, Bing and Qin, Xiaolong and Yao, Jen C.},\ntitle={Strong convergence of inertial projection and contraction methods for pseudomonotone variational inequalities with applications to optimal control problems},\njournal={Journal of Global Optimization},\nyear={2022},\nvolume={82},\nnumber={3},\npages={523--557},\ndoi={10.1007/s10898-021-01095-y},\nurl={https://bingtan.me/files/paper/TQY-JOGO2022.pdf},\nabstract={This paper investigates some inertial projection and contraction methods for solving pseudomonotone variational inequality problems in real Hilbert spaces. The algorithms use a new non-monotonic step size so that they can work without the prior knowledge of the Lipschitz constant of the operator. Strong convergence theorems of the suggested algorithms are obtained under some suitable conditions. Some numerical experiments in finite- and infinite-dimensional spaces and applications in optimal control problems are implemented to demonstrate the performance of the suggested schemes and we also compare them with several related results.},\nkeywords={Inertial method,  Optimal control problem,  Projection and contraction method,  Pseudomonotone operator,  Subgradient extragradient method,  Variational inequality problem},\nabbrev_source_title={J. Global Optim.},\n}\n\n
\n
\n\n\n
\n This paper investigates some inertial projection and contraction methods for solving pseudomonotone variational inequality problems in real Hilbert spaces. The algorithms use a new non-monotonic step size so that they can work without the prior knowledge of the Lipschitz constant of the operator. Strong convergence theorems of the suggested algorithms are obtained under some suitable conditions. Some numerical experiments in finite- and infinite-dimensional spaces and applications in optimal control problems are implemented to demonstrate the performance of the suggested schemes and we also compare them with several related results.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Qin, X.\n\n\n \n \n \n Modified inertial projection and contraction algorithms for solving variational inequality problems with non-Lipschitz continuous operators.\n \n \n\n\n \n\n\n\n Analysis and Mathematical Physics, 12(1): 26. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"ModifiedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TQ_AMP22,\nauthor={Tan, Bing and Qin, Xiaolong},\ntitle={Modified inertial projection and contraction algorithms for solving variational inequality problems with non-Lipschitz continuous operators},\njournal={Analysis and Mathematical Physics},\nyear={2022},\nvolume={12},\nnumber={1},\ndoi={10.1007/s13324-021-00638-6},\npages={26},\nurl={https://bingtan.me/files/paper/TQ-AMP2022.pdf},\nabstract={In this paper, we present four modified inertial projection and contraction methods to solve the variational inequality problem with a pseudo-monotone and non-Lipschitz continuous operator in real Hilbert spaces. Strong convergence theorems of the proposed algorithms are established without the prior knowledge of the Lipschitz constant of the operator. Several numerical experiments and the applications to optimal control problems are provided to verify the advantages and efficiency of the proposed algorithms.},\nkeywords={Inertial method,  Projection and contraction method,  Pseudomonotone operator,  Subgradient extragradient method,  Non-Lipschitz operator,  Variational inequality problem},\nabbrev_source_title={Anal. Math. Phys.},\n}\n\n
\n
\n\n\n
\n In this paper, we present four modified inertial projection and contraction methods to solve the variational inequality problem with a pseudo-monotone and non-Lipschitz continuous operator in real Hilbert spaces. Strong convergence theorems of the proposed algorithms are established without the prior knowledge of the Lipschitz constant of the operator. Several numerical experiments and the applications to optimal control problems are provided to verify the advantages and efficiency of the proposed algorithms.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Petruşel, A.; Qin, X.; and Yao, J. C.\n\n\n \n \n \n Global and linear convergence of alternated inertial single projection algorithms for pseudo-monotone variational inequalities.\n \n \n\n\n \n\n\n\n Fixed Point Theory, 23(1): 391–426. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"GlobalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TPQY_FPT22,\nauthor={Tan, Bing and Petruşel, Adrian and Qin, Xiaolong and Yao, Jen C.},\ntitle={Global and linear convergence of alternated inertial single projection algorithms for pseudo-monotone variational inequalities},\njournal={Fixed Point Theory},\nyear={2022},\nvolume={23},\nnumber={1},\npages={391--426},\ndoi={10.24193/fpt-ro.2022.1.25},\nurl={https://bingtan.me/files/paper/TPQY-FPT2022.pdf},\nabstract={In this paper, we investigate three new relaxed single projection methods with alternating inertial extrapolation steps and adaptive non-monotonic step sizes for solving pseudo-monotone variational inequalities in real Hilbert spaces. The proposed algorithms need to compute the projection on the feasible set only once in each iteration and they can work adaptively without the prior information of the Lipschitz constant of the mapping. The weak convergence theorems of the proposed iterative schemes are established under some appropriate conditions imposed on the parameters. These methods recover the Fejér monotonicity of the even subsequence with respect to the solution and obtain linear convergence rates. Finally, some numerical experiments and applications to optimal control problems are provided to demonstrate the advantages and efficiency of the proposed methods compared to some recent related ones.},\nkeywords={Adaptive stepsize,  Alternated inertial method,  Projection and contraction method,  Pseudomonotone operator,  Subgradient extragradient method,  Variational inequality problem},\nabbrev_source_title={Fixed Point Theory},\n}\n\n
\n
\n\n\n
\n In this paper, we investigate three new relaxed single projection methods with alternating inertial extrapolation steps and adaptive non-monotonic step sizes for solving pseudo-monotone variational inequalities in real Hilbert spaces. The proposed algorithms need to compute the projection on the feasible set only once in each iteration and they can work adaptively without the prior information of the Lipschitz constant of the mapping. The weak convergence theorems of the proposed iterative schemes are established under some appropriate conditions imposed on the parameters. These methods recover the Fejér monotonicity of the even subsequence with respect to the solution and obtain linear convergence rates. Finally, some numerical experiments and applications to optimal control problems are provided to demonstrate the advantages and efficiency of the proposed methods compared to some recent related ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Qin, X.\n\n\n \n \n \n Adaptive modified inertial projection and contraction methods for pseudomonotone variational inequalities.\n \n \n\n\n \n\n\n\n Journal of Applied and Numerical Optimization, 4(2): 221–243. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"AdaptivePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TQ_JANO22,\nauthor={Tan, Bing and Qin, Xiaolong},\ntitle={Adaptive modified inertial projection and contraction methods for pseudomonotone variational inequalities},\njournal={Journal of Applied and Numerical Optimization},\nyear={2022},\nvolume={4},\nnumber={2},\npages={221--243},\ndoi={10.23952/jano.4.2022.2.08},\nurl={https://bingtan.me/files/paper/TQ-JANO2022.pdf},\nabstract={To handle pseudomonotone variational inequality problems in real Hilbert spaces, four modified inertial projection and contraction algorithms with non-monotonic step sizes are suggested in this paper. The proposed algorithms take advantage of a novel non-monotonic step size criteria, allowing them to work without previous knowledge of the Lipschitz constant of the mapping involved. Under certain situations, the strong convergence of the iterative sequences generated by the suggested algorithms is established. Finally, several numerical experiments are offered to validate the theoretical conclusions.},\nkeywords={Inertial method, Pseudomonotone operator, Projection and contraction method, Subgradient extragradient method, Variational inequality problem},\nabbrev_source_title={J. Appl. Numer. Optim.},\n}\n\n
\n
\n\n\n
\n To handle pseudomonotone variational inequality problems in real Hilbert spaces, four modified inertial projection and contraction algorithms with non-monotonic step sizes are suggested in this paper. The proposed algorithms take advantage of a novel non-monotonic step size criteria, allowing them to work without previous knowledge of the Lipschitz constant of the mapping involved. Under certain situations, the strong convergence of the iterative sequences generated by the suggested algorithms is established. Finally, several numerical experiments are offered to validate the theoretical conclusions.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Qin, X.\n\n\n \n \n \n Self adaptive viscosity-type inertial extragradient algorithms for solving variational inequalities with applications.\n \n \n\n\n \n\n\n\n Mathematical Modelling and Analysis, 27(1): 41–58. 2022.\n \n\n(ESI Highly Cited Paper)\n\n
\n\n\n\n \n \n \"SelfPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TQ_MMA22,\nauthor={Tan, Bing and Qin, Xiaolong},\ntitle={Self adaptive viscosity-type inertial extragradient algorithms for solving variational inequalities with applications},\njournal={Mathematical Modelling and Analysis},\nyear={2022},\nvolume={27},\nnumber={1},\npages={41--58},\ndoi={10.3846/mma.2022.13846},\nurl={https://bingtan.me/files/paper/TQ-MMA2022.pdf},\nabstract={In this paper, we introduce two new inertial extragradient algorithms with non-monotonic stepsizes for solving monotone and Lipschitz continuous variational inequality problems in real Hilbert spaces. Strong convergence theorems of the suggested iterative schemes are established without the prior knowledge of the Lipschitz constant of the mapping. Finally, some numerical examples are provided to illustrate the efficiency and advantages of the proposed algorithms and compare them with some related ones.},\nkeywords={Inertial method, Subgradient extragradient method,  Tseng's extragradient method,  Optimal control problem,  Variational inequality problem,  Viscosity method},\nabbrev_source_title={Math. Model. Anal.},\nbibbase_note={<span style="color: red">(<s>ESI Highly Cited Paper</s>)</span>},\n}\n\n
\n
\n\n\n
\n In this paper, we introduce two new inertial extragradient algorithms with non-monotonic stepsizes for solving monotone and Lipschitz continuous variational inequality problems in real Hilbert spaces. Strong convergence theorems of the suggested iterative schemes are established without the prior knowledge of the Lipschitz constant of the mapping. Finally, some numerical examples are provided to illustrate the efficiency and advantages of the proposed algorithms and compare them with some related ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Liu, L.; and Qin, X.\n\n\n \n \n \n Strong convergence of inertial extragradient algorithms for solving variational inequalities and fixed point problems.\n \n \n\n\n \n\n\n\n Fixed Point Theory, 23(2): 707–728. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"StrongPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TLQ_FPT22,\nauthor={Tan, Bing and Liu, Liya and Qin, Xiaolong},\ntitle={Strong convergence of inertial extragradient algorithms for solving variational inequalities and fixed point problems},\njournal={Fixed Point Theory},\nyear={2022},\nvolume={23},\nnumber={2},\npages={707--728},\ndoi={10.24193/fpt-ro.2022.2.17},\nurl={https://bingtan.me/files/paper/TLQ-FPT2022.pdf},\nabstract={This paper investigates two inertial extragradient algorithms for seeking a common solution to a variational inequality problem involving a monotone and Lipschitz continuous mapping and a fixed point problem with a demicontractive mapping in real Hilbert spaces. Our algorithms need to calculate the projection on the feasible set only once in each iteration. Moreover, they can work well without the prior information of the Lipschitz constant of the operator and do not contain any linesearch process. Strong convergence theorems of the suggested algorithms are established under suitable conditions. Some experiments are presented to illustrate the numerical efficiency of the suggested algorithms and compare them with some existing ones.},\nkeywords={Variational inequality problem, Fixed point problem, Subgradient extragradient method, Tseng's extragradient method, Inertial method, Demicontractive mapping},\nabbrev_source_title={Fixed Point Theory},\n}\n\n
\n
\n\n\n
\n This paper investigates two inertial extragradient algorithms for seeking a common solution to a variational inequality problem involving a monotone and Lipschitz continuous mapping and a fixed point problem with a demicontractive mapping in real Hilbert spaces. Our algorithms need to calculate the projection on the feasible set only once in each iteration. Moreover, they can work well without the prior information of the Lipschitz constant of the operator and do not contain any linesearch process. Strong convergence theorems of the suggested algorithms are established under suitable conditions. Some experiments are presented to illustrate the numerical efficiency of the suggested algorithms and compare them with some existing ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Fan, J.; Qin, X.; and Tan, B.\n\n\n \n \n \n Tseng's extragradient algorithm for pseudomonotone variational inequalities on Hadamard manifolds.\n \n \n\n\n \n\n\n\n Applicable Analysis, 101(6): 2372–2385. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"Tseng'sPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{FQT_AA22,\nauthor={Fan, Jingjing and Qin, Xiaolong and Tan, Bing},\ntitle={Tseng's extragradient algorithm for pseudomonotone variational inequalities on {H}adamard manifolds},\njournal={Applicable Analysis},\nyear={2022},\nvolume={101},\nnumber={6},\npages={2372--2385},\ndoi={10.1080/00036811.2020.1807012},\nurl={https://bingtan.me/files/paper/FQT-AA2022.pdf},\nabstract={In this paper, we investigate the Tseng's extragradient algorithm for non-Lipschitzian variational inequalities with pseudomonotone vector fields on Hadamard manifolds. The convergence analysis of the proposed algorithm is discussed under mild assumptions. Two experiments are provided to illustrate the asymptotical behavior of the algorithm. The results presented in this paper generalize some known results presented in the literature.},\nkeywords={Extragradient method,  Hadamard manifolds,  Non-Lipschitz operator,  Pseudomonotone vector field,  Variational inequality problem},\nabbrev_source_title={Appl. Anal.},\n}\n\n
\n
\n\n\n
\n In this paper, we investigate the Tseng's extragradient algorithm for non-Lipschitzian variational inequalities with pseudomonotone vector fields on Hadamard manifolds. The convergence analysis of the proposed algorithm is discussed under mild assumptions. Two experiments are provided to illustrate the asymptotical behavior of the algorithm. The results presented in this paper generalize some known results presented in the literature.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Qin, X.; and Yao, J. C.\n\n\n \n \n \n Strong convergence of self-adaptive inertial algorithms for solving split variational inclusion problems with applications.\n \n \n\n\n \n\n\n\n Journal of Scientific Computing, 87(1): 20. 2021.\n \n\n(ESI Highly Cited Paper)\n\n
\n\n\n\n \n \n \"StrongPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TQY_JSC21,\nauthor={Tan, Bing and Qin, Xiaolong and Yao, Jen C.},\ntitle={Strong convergence of self-adaptive inertial algorithms for solving split variational inclusion problems with applications},\njournal={Journal of Scientific Computing},\nyear={2021},\nvolume={87},\nnumber={1},\ndoi={10.1007/s10915-021-01428-9},\npages={20},\nurl={https://bingtan.me/files/paper/TQY-JSC2021.pdf},\nabstract={In this paper, four self-adaptive iterative algorithms with inertial effects are introduced to solve a split variational inclusion problem in real Hilbert spaces. One of the advantages of the suggested algorithms is that they can work without knowing the prior information of the operator norm. Strong convergence theorems of these algorithms are established under mild and standard assumptions. As applications, the split feasibility problem and the split minimization problem in real Hilbert spaces are studied. Finally, several preliminary numerical experiments as well as an example in the field of compressed sensing are proposed to support the advantages and efficiency of the suggested methods over some existing ones.},\nkeywords={Inertial method,  Mann method,  Signal processing problem,  Split variational inclusion problem,  Strong convergence,  Viscosity method},\nabbrev_source_title={J. Sci. Comput.},\nbibbase_note={<span style="color: red">(ESI Highly Cited Paper)</span>},\n}\n\n
\n
\n\n\n
\n In this paper, four self-adaptive iterative algorithms with inertial effects are introduced to solve a split variational inclusion problem in real Hilbert spaces. One of the advantages of the suggested algorithms is that they can work without knowing the prior information of the operator norm. Strong convergence theorems of these algorithms are established under mild and standard assumptions. As applications, the split feasibility problem and the split minimization problem in real Hilbert spaces are studied. Finally, several preliminary numerical experiments as well as an example in the field of compressed sensing are proposed to support the advantages and efficiency of the suggested methods over some existing ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Qin, X.; and Yao, J. C.\n\n\n \n \n \n Two modified inertial projection algorithms for bilevel pseudomonotone variational inequalities with applications to optimal control problems.\n \n \n\n\n \n\n\n\n Numerical Algorithms, 88(4): 1757–1786. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"TwoPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TQY_NUMA21,\nauthor={Tan, Bing and Qin, Xiaolong and Yao, Jen C.},\ntitle={Two modified inertial projection algorithms for bilevel pseudomonotone variational inequalities with applications to optimal control problems},\njournal={Numerical Algorithms},\nyear={2021},\nvolume={88},\nnumber={4},\npages={1757--1786},\ndoi={10.1007/s11075-021-01093-x},\nurl={https://bingtan.me/files/paper/TQY-NUMA2021.pdf},\nabstract={In this paper, we investigate two new algorithms for solving bilevel pseudomonotone variational inequality problems in real Hilbert spaces. The advantages of our algorithms are that they only need to calculate one projection on the feasible set in each iteration, and do not require the prior information of the Lipschitz constant of the cost operator. Furthermore, two new algorithms are derived to solve variational inequality problems. We establish the strong convergence of the proposed algorithms under some suitable conditions imposed on parameters. Finally, several numerical results and applications in optimal control problems are reported to illustrate the efficiency and advantages of the proposed algorithms.},\nkeywords={Bilevel variational inequality problem,  Hybrid steepest descent method,  Inertial extragradient method,  Projection and contraction method,  Pseudomonotone operator},\nabbrev_source_title={Numer. Algorithms},\n}\n\n
\n
\n\n\n
\n In this paper, we investigate two new algorithms for solving bilevel pseudomonotone variational inequality problems in real Hilbert spaces. The advantages of our algorithms are that they only need to calculate one projection on the feasible set in each iteration, and do not require the prior information of the Lipschitz constant of the cost operator. Furthermore, two new algorithms are derived to solve variational inequality problems. We establish the strong convergence of the proposed algorithms under some suitable conditions imposed on parameters. Finally, several numerical results and applications in optimal control problems are reported to illustrate the efficiency and advantages of the proposed algorithms.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Liu, L.; and Qin, X.\n\n\n \n \n \n Self adaptive inertial extragradient algorithms for solving bilevel pseudomonotone variational inequality problems.\n \n \n\n\n \n\n\n\n Japan Journal of Industrial and Applied Mathematics, 38(2): 519-543. 2021.\n \n\n(ESI Highly Cited Paper)\n\n
\n\n\n\n \n \n \"SelfPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TLQ_JIAM21,\nauthor={Tan, Bing and Liu, Liya and Qin, Xiaolong},\ntitle={Self adaptive inertial extragradient algorithms for solving bilevel pseudomonotone variational inequality problems},\njournal={Japan Journal of Industrial and Applied Mathematics},\nyear={2021},\nvolume={38},\nnumber={2},\npages={519-543},\ndoi={10.1007/s13160-020-00450-y},\nurl={https://bingtan.me/files/paper/TLQ-JIAM2021.pdf},\nabstract={We introduce two inertial extragradient algorithms for solving a bilevel pseudomonotone variational inequality problem in real Hilbert spaces. The advantages of the proposed algorithms are that they can work without the prior knowledge of the Lipschitz constant of the involving operator and only one projection onto the feasible set is required. Strong convergence theorems of the suggested algorithms are obtained under suitable conditions. Finally, some numerical examples are provided to show the efficiency of the proposed algorithms.},\nkeywords={Bilevel variational inequality problem,  Inertial method, Subgradient extragradient method,  Tseng's extragradient method,  Pseudomonotone operator,  Hybrid steepest descent method},\nabbrev_source_title={Jpn J. Ind. Appl. Math.},\nbibbase_note={<span style="color: red">(<s>ESI Highly Cited Paper</s>)</span>},\n}\n\n
\n
\n\n\n
\n We introduce two inertial extragradient algorithms for solving a bilevel pseudomonotone variational inequality problem in real Hilbert spaces. The advantages of the proposed algorithms are that they can work without the prior knowledge of the Lipschitz constant of the involving operator and only one projection onto the feasible set is required. Strong convergence theorems of the suggested algorithms are obtained under suitable conditions. Finally, some numerical examples are provided to show the efficiency of the proposed algorithms.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Fan, J.; and Qin, X.\n\n\n \n \n \n Inertial extragradient algorithms with non-monotonic step sizes for solving variational inequalities and fixed point problems.\n \n \n\n\n \n\n\n\n Advances in Operator Theory, 6(4): 61. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TFQ_AIOT21,\nauthor={Tan, Bing and Fan, Jingjing and Qin, Xiaolong},\ntitle={Inertial extragradient algorithms with non-monotonic step sizes for solving variational inequalities and fixed point problems},\njournal={Advances in Operator Theory},\nyear={2021},\nvolume={6},\nnumber={4},\ndoi={10.1007/s43036-021-00155-0},\npages={61},\nurl={https://bingtan.me/files/paper/TFQ-AIOT2021.pdf},\nabstract={In this paper, we introduce four inertial extragradient algorithms with non-monotonic step sizes to find the solution of the convex feasibility problem, which consists of a monotone variational inequality problem and a fixed point problem with a demicontractive mapping. Strong convergence theorems of the suggested algorithms are established under some standard conditions. Finally, we implement some computational tests to show the efficiency and advantages of the proposed algorithms and compare them with some existing ones.},\nkeywords={Fixed point problem,  Inertial method,  Strong convergence,  Subgradient extragradient method,  Tseng's extragradient method,  Variational inequality problem},\nabbrev_source_title={Adv. Oper. Theory},\n}\n\n
\n
\n\n\n
\n In this paper, we introduce four inertial extragradient algorithms with non-monotonic step sizes to find the solution of the convex feasibility problem, which consists of a monotone variational inequality problem and a fixed point problem with a demicontractive mapping. Strong convergence theorems of the suggested algorithms are established under some standard conditions. Finally, we implement some computational tests to show the efficiency and advantages of the proposed algorithms and compare them with some existing ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Li, S.; and Qin, X.\n\n\n \n \n \n Self-adaptive inertial single projection methods for variational inequalities involving non-Lipschitz and Lipschitz operators with their applications to optimal control problems.\n \n \n\n\n \n\n\n\n Applied Numerical Mathematics, 170: 219–241. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"Self-adaptivePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TLQ_ANM21,\nauthor={Tan, Bing and Li, Songxiao and Qin, Xiaolong},\ntitle={Self-adaptive inertial single projection methods for variational inequalities involving non-Lipschitz and Lipschitz operators with their applications to optimal control problems},\njournal={Applied Numerical Mathematics},\nyear={2021},\nvolume={170},\npages={219--241},\ndoi={10.1016/j.apnum.2021.07.022},\nurl={https://bingtan.me/files/paper/TLQ-ANM2021.pdf},\nabstract={In this paper, four accelerated subgradient extragradient methods are proposed to solve the variational inequality problem with a pseudo-monotone operator in real Hilbert spaces. These iterative schemes employ two new adaptive stepsize strategies that are significant when the Lipschitz constant of the mapping involved is unknown. Strong convergence theorems for the proposed algorithms are established under the condition that the operators are Lipschitz continuous and non-Lipschitz continuous. Numerical experiments on finite- and infinite-dimensional spaces and applications in optimal control problems are reported to demonstrate the advantages and efficiency of the proposed algorithms over some existing results.},\nkeywords={Inertial method, Subgradient extragradient method,  Optimal control problem,  Pseudomonotone operator,  Non-Lipschitz operator,  Variational inequality problem},\nabbrev_source_title={Appl Numer Math},\n}\n\n
\n
\n\n\n
\n In this paper, four accelerated subgradient extragradient methods are proposed to solve the variational inequality problem with a pseudo-monotone operator in real Hilbert spaces. These iterative schemes employ two new adaptive stepsize strategies that are significant when the Lipschitz constant of the mapping involved is unknown. Strong convergence theorems for the proposed algorithms are established under the condition that the operators are Lipschitz continuous and non-Lipschitz continuous. Numerical experiments on finite- and infinite-dimensional spaces and applications in optimal control problems are reported to demonstrate the advantages and efficiency of the proposed algorithms over some existing results.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Li, S.; and Qin, X.\n\n\n \n \n \n An accelerated extragradient algorithm for bilevel pseudomonotone variational inequality problems with application to optimal control problems.\n \n \n\n\n \n\n\n\n Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas, 115(4): 174. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TLQ_RCSM21,\nauthor={Tan, Bing and Li, Songxiao and Qin, Xiaolong},\ntitle={An accelerated extragradient algorithm for bilevel pseudomonotone variational inequality problems with application to optimal control problems},\njournal={Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas},\nyear={2021},\nvolume={115},\nnumber={4},\ndoi={10.1007/s13398-021-01116-1},\npages={174},\nurl={https://bingtan.me/files/paper/TLQ-RACSAM2021.pdf},\nabstract={In this paper, an inertial extragradient algorithm with a new non-monotonic stepsize is proposed to solve the bilevel pseudomonotone variational inequality problem in real Hilbert spaces. The advantages of the suggested iterative algorithm are that only one projection onto the feasible set needs to be performed in each iteration and the prior knowledge of the Lipschitz constant of the mapping involved does not require to be known. The strong convergence theorem of the suggested algorithm is established under some suitable conditions. Numerical experiments are reported to illustrate the advantages and efficiency of the presented algorithm over the existing related ones.},\nkeywords={Bilevel variational inequality problem,  Hybrid steepest descent method,  Inertial extragradient method,  Projection and contraction method,  Pseudomonotone operator},\nabbrev_source_title={Rev. R. Acad. Cienc. Exactas F{\\' i}s. Nat. Ser. A Mat. RACSAM},\n}\n\n
\n
\n\n\n
\n In this paper, an inertial extragradient algorithm with a new non-monotonic stepsize is proposed to solve the bilevel pseudomonotone variational inequality problem in real Hilbert spaces. The advantages of the suggested iterative algorithm are that only one projection onto the feasible set needs to be performed in each iteration and the prior knowledge of the Lipschitz constant of the mapping involved does not require to be known. The strong convergence theorem of the suggested algorithm is established under some suitable conditions. Numerical experiments are reported to illustrate the advantages and efficiency of the presented algorithm over the existing related ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Li, S.; and Qin, X.\n\n\n \n \n \n On modified subgradient extragradient methods for pseudomonotone variational inequality problems with applications.\n \n \n\n\n \n\n\n\n Computational and Applied Mathematics, 40(7): 253. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TLQ_COAM21,\nauthor={Tan, Bing and Li, Songxiao and Qin, Xiaolong},\ntitle={On modified subgradient extragradient methods for pseudomonotone variational inequality problems with applications},\njournal={Computational and Applied Mathematics},\nyear={2021},\nvolume={40},\nnumber={7},\ndoi={10.1007/s40314-021-01642-z},\npages={253},\nurl={https://bingtan.me/files/paper/TLQ-COAM2021.pdf},\nabstract={This paper presents several modified subgradient extragradient methods with inertial effects to approximate solutions of variational inequality problems in real Hilbert spaces. The operators involved are either pseudomonotone Lipschitz continuous or pseudomonotone non-Lipschitz continuous. The advantage of the suggested algorithms is that they can work adaptively without the prior information of the Lipschitz constant of the mapping involved. Strong convergence theorems of the proposed algorithms are established under some suitable conditions. Finally, some numerical experiments are given to verify the advantages and efficiency of the proposed iterative algorithms with respect to previously known ones.},\nkeywords={Extragradient method,  Non-Lipschitz operator,  Optimal control problem,  Pseudomonotone operator,  Variational inequality problem},\nabbrev_source_title={Comput. Appl. Math.},\n}\n\n
\n
\n\n\n
\n This paper presents several modified subgradient extragradient methods with inertial effects to approximate solutions of variational inequality problems in real Hilbert spaces. The operators involved are either pseudomonotone Lipschitz continuous or pseudomonotone non-Lipschitz continuous. The advantage of the suggested algorithms is that they can work adaptively without the prior information of the Lipschitz constant of the mapping involved. Strong convergence theorems of the proposed algorithms are established under some suitable conditions. Finally, some numerical experiments are given to verify the advantages and efficiency of the proposed iterative algorithms with respect to previously known ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Fan, J.; Qin, X.; and Tan, B.\n\n\n \n \n \n Convergence of an inertial shadow Douglas-Rachford splitting algorithm for monotone inclusions.\n \n \n\n\n \n\n\n\n Numerical Functional Analysis and Optimization, 42(14): 1627–1644. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"ConvergencePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{FQT_NFAO21,\nauthor={Fan, Jingjing and Qin, Xiaolong and Tan, Bing},\ntitle={Convergence of an inertial shadow {D}ouglas-{R}achford splitting algorithm for monotone inclusions},\njournal={Numerical Functional Analysis and Optimization},\nyear={2021},\nvolume={42},\nnumber={14},\npages={1627--1644},\ndoi={10.1080/01630563.2021.2001749},\nurl={https://bingtan.me/files/paper/FQT-NFAO2021.pdf},\nabstract={An inertial shadow Douglas-Rachford splitting algorithm for finding zeros of the sum of monotone operators is proposed in Hilbert spaces. Moreover, a three-operator splitting algorithm for solving a class of monotone inclusion problems is also concerned. The weak convergence of the algorithms is investigated under mild assumptions. Some numerical experiments are implemented to illustrate our main convergence results.},\nkeywords={Inertial method,  Monotone inclusion,  Shadow Douglas-Rachford splitting algorithm,  Three-operator splitting},\nabbrev_source_title={Numer. Funct. Anal. Optim.},\n}\n\n
\n
\n\n\n
\n An inertial shadow Douglas-Rachford splitting algorithm for finding zeros of the sum of monotone operators is proposed in Hilbert spaces. Moreover, a three-operator splitting algorithm for solving a class of monotone inclusion problems is also concerned. The weak convergence of the algorithms is investigated under mild assumptions. Some numerical experiments are implemented to illustrate our main convergence results.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Zhou, Z.; and Qin, X.\n\n\n \n \n \n Accelerated projection-based forward-backward splitting algorithms for monotone inclusion problems.\n \n \n\n\n \n\n\n\n Journal of Applied Analysis and Computation, 10(5): 2184–2197. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"AcceleratedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TZQ_JAAC20,\nauthor={Tan, Bing and Zhou, Zheng and Qin, Xiaolong},\ntitle={Accelerated projection-based forward-backward splitting algorithms for monotone inclusion problems},\njournal={Journal of Applied Analysis and Computation},\nyear={2020},\nvolume={10},\nnumber={5},\npages={2184--2197},\ndoi={10.11948/20190363},\nurl={https://bingtan.me/files/paper/TZQ-JAAC2020.pdf},\nabstract={In this paper, based on inertial and Tseng's ideas, we propose two projection-based algorithms to solve a monotone inclusion problem in infinite dimensional Hilbert spaces. Solution theorems of strong convergence are obtained under the certain conditions. Some numerical experiments are presented to illustrate that our algorithms are efficient than the existing results.},\nkeywords={Forward-backward splitting algorithm,  Inclusion problem,  Monotone operator,  Strong convergence},\nabbrev_source_title={J. Appl. Anal. Comput.},\n}\n\n
\n
\n\n\n
\n In this paper, based on inertial and Tseng's ideas, we propose two projection-based algorithms to solve a monotone inclusion problem in infinite dimensional Hilbert spaces. Solution theorems of strong convergence are obtained under the certain conditions. Some numerical experiments are presented to illustrate that our algorithms are efficient than the existing results.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n Shang, M.\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Luo, Y.; Shang, M.; and Tan, B.\n\n\n \n \n \n A general inertial viscosity type method for nonexpansive mappings and its applications in signal processing.\n \n \n\n\n \n\n\n\n Mathematics, 8(2): 288. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{LST_MATH20,\nauthor={Luo, Yinglin and Shang, Meijuan and Tan, Bing},\ntitle={A general inertial viscosity type method for nonexpansive mappings and its applications in signal processing},\njournal={Mathematics},\nyear={2020},\nvolume={8},\nnumber={2},\ndoi={10.3390/math8020288},\npages={288},\nurl={https://bingtan.me/files/paper/LST-Math2020.pdf},\nabstract={In this paper, we propose viscosity algorithms with two different inertia parameters for solving fixed points of nonexpansive and strictly pseudocontractive mappings. Strong convergence theorems are obtained in Hilbert spaces and the applications to the signal processing are considered. Moreover, some numerical experiments of proposed algorithms and comparisons with existing algorithms are given to the demonstration of the efficiency of the proposed algorithms. The numerical results show that our algorithms are superior to some related algorithms.},\nkeywords={Inclusion problem,  Nonexpansive mapping,  Signal processing problem,  Strict pseudo-contraction,  Variational inequality problem},\nabbrev_source_title={Mathematics},\n}\n\n\n\n\n\n\n\n\n\n
\n
\n\n\n
\n In this paper, we propose viscosity algorithms with two different inertia parameters for solving fixed points of nonexpansive and strictly pseudocontractive mappings. Strong convergence theorems are obtained in Hilbert spaces and the applications to the signal processing are considered. Moreover, some numerical experiments of proposed algorithms and comparisons with existing algorithms are given to the demonstration of the efficiency of the proposed algorithms. The numerical results show that our algorithms are superior to some related algorithms.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n Sunthrayuth, P.\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Tan, B.; Sunthrayuth, P.; Cholamjiak, P.; and Cho, Y. J.\n\n\n \n \n \n Modified inertial extragradient methods for finding minimum-norm solution of the variational inequality problem with applications to optimal control problem.\n \n \n\n\n \n\n\n\n International Journal of Computer Mathematics, 100(3): 525–545. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"ModifiedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TSCC_IJCM23,\nauthor={Tan, Bing and Sunthrayuth, Pongsakorn and Cholamjiak, Prasit and  Cho, Yeol J.},\ntitle={Modified inertial extragradient methods for finding minimum-norm solution of the variational inequality problem with applications to optimal control problem},\njournal={International Journal of Computer Mathematics},\nyear={2023},\nvolume={100},\nnumber={3},\npages={525--545},\ndoi={10.1080/00207160.2022.2137672},\nurl={https://bingtan.me/files/paper/TSCC-IJCM23.pdf},\nabstract={In order to discover the minimum-norm solution of the pseudomonotone variational inequality problem in a real Hilbert space, we provide two variants of the inertial extragradient approach with a novel generalized adaptive step size. Two of the suggested algorithms make use of the projection and contraction methods. We demonstrate several strong convergence findings without requiring the prior knowledge of the Lipschitz constant of the mapping. Finally, we give a number of numerical examples that highlight the benefits and effectiveness of the suggested algorithms and how they may be used to solve the optimal control problem.},\nkeywords={Variational inequality problem, Optimal control problem, Inertial method, Projection and contraction method},\nabbrev_source_title={Int. J. Comput. Math.},\n}\n\n
\n
\n\n\n
\n In order to discover the minimum-norm solution of the pseudomonotone variational inequality problem in a real Hilbert space, we provide two variants of the inertial extragradient approach with a novel generalized adaptive step size. Two of the suggested algorithms make use of the projection and contraction methods. We demonstrate several strong convergence findings without requiring the prior knowledge of the Lipschitz constant of the mapping. Finally, we give a number of numerical examples that highlight the benefits and effectiveness of the suggested algorithms and how they may be used to solve the optimal control problem.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n Tan, B.\n \n \n (58)\n \n \n
\n
\n \n \n
\n \n\n \n \n Tan, B.; Qin, X.; and Wang, X.\n\n\n \n \n \n Alternated inertial algorithms for split feasibility problems.\n \n \n\n\n \n\n\n\n Numerical Algorithms, 95(2): 773–812. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"AlternatedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TQW_NUMA24,\nauthor={Tan, Bing and Qin, Xiaolong and Wang, Xianfu},\ntitle={Alternated inertial algorithms for split feasibility problems},\njournal={Numerical Algorithms},\nyear={2024},\nvolume={95},\nnumber={2},\npages={773--812},\ndoi={10.1007/s11075-023-01589-8},\nurl={https://bingtan.me/files/paper/TQW-NUMA2024.pdf},\nabstract={We introduce four novel relaxed CQ algorithms with alternating inertial for solving split feasibility problems in real Hilbert spaces. The proposed algorithms employ a new non-monotonic adaptive step size criterion and utilize two different step sizes in each iteration. The weak convergence of the iterative sequences generated by the proposed algorithms is established under some weak conditions. Moreover, the Fejér monotonicity of the even subsequence with respect to the solution set is recovered. Two applications in signal denoising and image deblurring are given to illustrate the computational efficiency of our algorithms.},\nkeywords={Split feasibility problem,  CQ method,  Projection and contraction method,  Alternated inertial method,  Signal processing,  Image restoration},\nabbrev_source_title={Numer. Algorithms},\n}\n\n
\n
\n\n\n
\n We introduce four novel relaxed CQ algorithms with alternating inertial for solving split feasibility problems in real Hilbert spaces. The proposed algorithms employ a new non-monotonic adaptive step size criterion and utilize two different step sizes in each iteration. The weak convergence of the iterative sequences generated by the proposed algorithms is established under some weak conditions. Moreover, the Fejér monotonicity of the even subsequence with respect to the solution set is recovered. Two applications in signal denoising and image deblurring are given to illustrate the computational efficiency of our algorithms.\n
\n\n\n
\n\n\n
\n \n\n \n \n Xie, Z.; Cai, G.; and Tan, B.\n\n\n \n \n \n Inertial subgradient extragradient method for solving pseudomonotone equilibrium probelms and fixed point problems in Hilbert spaces.\n \n \n\n\n \n\n\n\n Optimization, 73(5): 1329-1354. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{XCT_OPT24,\nauthor={Xie, Zhongbing and Cai, Gang and Tan, Bing},\ntitle={Inertial subgradient extragradient method for solving pseudomonotone equilibrium probelms and fixed point problems in Hilbert spaces},\njournal={Optimization},\nyear={2024},\nvolume={73},\nnumber={5},\npages={1329-1354},\ndoi={10.1080/02331934.2022.2157677},\nurl={https://bingtan.me/files/paper/XCT-OPT2024.pdf},\nabstract={This paper proposes a new inertial subgradient extragradient method for solving equilibrium problems with pseudomonotone and Lipschitz-type bifunctions and fixed point problems for nonexpansive mappings in real Hilbert spaces. Precisely, we prove that the sequence generated by proposed algorithm converges strongly to a common solution of equilibrium problems and fixed point problems. We use an effective self-adaptive step size rule to accelerate the convergence process of our proposed iterative algorithm. Moreover, some numerical results are given to show the effectiveness of the proposed algorithm. The results obtained in this paper extend and improve many recent ones in the literature.},\nkeywords={Inertial method,  Subgradient extragradient method, Equilibrium probelm, Fixed point problem, Strong convergence},\nabbrev_source_title={Optimization},\n}\n\n
\n
\n\n\n
\n This paper proposes a new inertial subgradient extragradient method for solving equilibrium problems with pseudomonotone and Lipschitz-type bifunctions and fixed point problems for nonexpansive mappings in real Hilbert spaces. Precisely, we prove that the sequence generated by proposed algorithm converges strongly to a common solution of equilibrium problems and fixed point problems. We use an effective self-adaptive step size rule to accelerate the convergence process of our proposed iterative algorithm. Moreover, some numerical results are given to show the effectiveness of the proposed algorithm. The results obtained in this paper extend and improve many recent ones in the literature.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Qin, X.\n\n\n \n \n \n An alternated inertial algorithm with weak and linear convergence for solving monotone inclusions.\n \n \n\n\n \n\n\n\n Annals of Mathematical Sciences and Applications, 8(2): 321–345. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TQ_AMSA23,\nauthor={Tan, Bing and Qin, Xiaolong},\ntitle={An alternated inertial algorithm with weak and linear convergence for solving monotone inclusions},\njournal={Annals of Mathematical Sciences and Applications},\nyear={2023},\nvolume={8},\nnumber={2},\npages={321--345},\ndoi={10.4310/AMSA.2023.v8.n2.a7},\nurl={https://bingtan.me/files/paper/TQ-AMSA2023.pdf},\nabstract={Inertial-based methods have the drawback of not preserving the Fejér monotonicity of iterative sequences, which may result in slower convergence compared to their corresponding non-inertial versions. To overcome this issue, Mu and Peng [Stat. Optim. Inf. Comput. 3 (2015), 241–248; MR3393305] suggested an alternating inertial method that can recover the Fejér monotonicity of even subsequences. In this paper, we propose a modified version of the forward-backward algorithm with alternating inertial and relaxation effects to solve an inclusion problem in real Hilbert spaces. The weak and linear convergence of the presented algorithm is established under suitable and mild conditions on the involved operators and parameters. Furthermore, the Fejér monotonicity of even subsequences generated by the proposed algorithm with respect to the solution set is recovered. Finally, our tests on image restoration problems demonstrate the superiority of the proposed algorithm over some related results.},\nkeywords={Inclusion problems, Alternated inertial, Forward-backward method, Tseng's method, Projection and contraction method, Linear convergence},\nabbrev_source_title={Ann. Math. Sci. Appl.},\n}\n\n
\n
\n\n\n
\n Inertial-based methods have the drawback of not preserving the Fejér monotonicity of iterative sequences, which may result in slower convergence compared to their corresponding non-inertial versions. To overcome this issue, Mu and Peng [Stat. Optim. Inf. Comput. 3 (2015), 241–248; MR3393305] suggested an alternating inertial method that can recover the Fejér monotonicity of even subsequences. In this paper, we propose a modified version of the forward-backward algorithm with alternating inertial and relaxation effects to solve an inclusion problem in real Hilbert spaces. The weak and linear convergence of the presented algorithm is established under suitable and mild conditions on the involved operators and parameters. Furthermore, the Fejér monotonicity of even subsequences generated by the proposed algorithm with respect to the solution set is recovered. Finally, our tests on image restoration problems demonstrate the superiority of the proposed algorithm over some related results.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Qin, X.; and Gibali, A.\n\n\n \n \n \n Three approximation methods for solving constraint variational inequalities and related problems.\n \n \n\n\n \n\n\n\n Pure and Applied Functional Analysis, 8(3): 965–986. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"ThreePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TGQ_PAFA23,\nauthor={Tan, Bing and Qin, Xiaolong and Gibali, Aviv},\ntitle={Three approximation methods for solving constraint variational inequalities and related problems},\njournal={Pure and Applied Functional Analysis},\nyear={2023},\nvolume={8},\nnumber={3},\npages={965--986},\nurl={https://bingtan.me/files/paper/TGQ_PAFA2023.pdf},\nabstract={In this paper, we present three new self-adaptive one-projection algorithms to find common solutions for the pseudo-monotone variational inequality problem and the fixed point problem of a demi-contractive mapping. Note that the suggested approaches use a non-monotonic self-adaptive step size so that they can work well without knowing the prior knowledge of the Lipschitz constant of the mapping. Strong convergence theorems of the proposed iterative schemes are established in real Hilbert spaces. Several mathematical experiments are reported to demonstrate the numerical behavior of the suggested algorithms and compare them with the existing ones. Finally, the suggested methods are used to solve optimal control problems.},\nkeywords={Variational inequality, Fixed point, Extragradient method, Hybrid steepest descent method, Pseudomonotone mapping},\nabbrev_source_title={Pure Appl. Funct. Anal.},\n}\n\n
\n
\n\n\n
\n In this paper, we present three new self-adaptive one-projection algorithms to find common solutions for the pseudo-monotone variational inequality problem and the fixed point problem of a demi-contractive mapping. Note that the suggested approaches use a non-monotonic self-adaptive step size so that they can work well without knowing the prior knowledge of the Lipschitz constant of the mapping. Strong convergence theorems of the proposed iterative schemes are established in real Hilbert spaces. Several mathematical experiments are reported to demonstrate the numerical behavior of the suggested algorithms and compare them with the existing ones. Finally, the suggested methods are used to solve optimal control problems.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Li, S.; and Cho, S. Y.\n\n\n \n \n \n Inertial projection and contraction methods for pseudomonotone variational inequalities with non-Lipschitz operators and applications.\n \n \n\n\n \n\n\n\n Applicable Analysis, 102(4): 1199–1221. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TLC_AA23,\nauthor={Tan, Bing and Li, Songxiao and Cho, Sun Y.},\ntitle={Inertial projection and contraction methods for pseudomonotone variational inequalities with non-Lipschitz operators and applications},\njournal={Applicable Analysis},\nyear={2023},\nvolume={102},\nnumber={4},\ndoi={10.1080/00036811.2021.1979219},\npages={1199--1221},\nurl={https://bingtan.me/files/paper/TLC-AA2023.pdf},\nabstract={In this paper, some new accelerated iterative schemes are proposed to solve the variational inequality problem with a pseudomonotone and uniformly continuous operator in real Hilbert spaces. Strong convergence theorems of the suggested algorithms are obtained without the prior knowledge of the Lipschitz constant of the operator. Some numerical experiments and applications are performed to illustrate the advantages of the proposed methods with respect to several related ones.},\nkeywords={Inertial extragradient method,  Projection and contraction method,  Pseudomonotone operator,  Non-Lipschitz operator,  Variational inequality problem},\nabbrev_source_title={Appl. Anal.},\n}\n\n
\n
\n\n\n
\n In this paper, some new accelerated iterative schemes are proposed to solve the variational inequality problem with a pseudomonotone and uniformly continuous operator in real Hilbert spaces. Strong convergence theorems of the suggested algorithms are obtained without the prior knowledge of the Lipschitz constant of the operator. Some numerical experiments and applications are performed to illustrate the advantages of the proposed methods with respect to several related ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Sunthrayuth, P.; Cholamjiak, P.; and Cho, Y. J.\n\n\n \n \n \n Modified inertial extragradient methods for finding minimum-norm solution of the variational inequality problem with applications to optimal control problem.\n \n \n\n\n \n\n\n\n International Journal of Computer Mathematics, 100(3): 525–545. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"ModifiedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TSCC_IJCM23,\nauthor={Tan, Bing and Sunthrayuth, Pongsakorn and Cholamjiak, Prasit and  Cho, Yeol J.},\ntitle={Modified inertial extragradient methods for finding minimum-norm solution of the variational inequality problem with applications to optimal control problem},\njournal={International Journal of Computer Mathematics},\nyear={2023},\nvolume={100},\nnumber={3},\npages={525--545},\ndoi={10.1080/00207160.2022.2137672},\nurl={https://bingtan.me/files/paper/TSCC-IJCM23.pdf},\nabstract={In order to discover the minimum-norm solution of the pseudomonotone variational inequality problem in a real Hilbert space, we provide two variants of the inertial extragradient approach with a novel generalized adaptive step size. Two of the suggested algorithms make use of the projection and contraction methods. We demonstrate several strong convergence findings without requiring the prior knowledge of the Lipschitz constant of the mapping. Finally, we give a number of numerical examples that highlight the benefits and effectiveness of the suggested algorithms and how they may be used to solve the optimal control problem.},\nkeywords={Variational inequality problem, Optimal control problem, Inertial method, Projection and contraction method},\nabbrev_source_title={Int. J. Comput. Math.},\n}\n\n
\n
\n\n\n
\n In order to discover the minimum-norm solution of the pseudomonotone variational inequality problem in a real Hilbert space, we provide two variants of the inertial extragradient approach with a novel generalized adaptive step size. Two of the suggested algorithms make use of the projection and contraction methods. We demonstrate several strong convergence findings without requiring the prior knowledge of the Lipschitz constant of the mapping. Finally, we give a number of numerical examples that highlight the benefits and effectiveness of the suggested algorithms and how they may be used to solve the optimal control problem.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Li, S.\n\n\n \n \n \n Adaptive inertial subgradient extragradient methods for finding minimum-norm solutions of pseudomonotone variational inequalities.\n \n \n\n\n \n\n\n\n Journal of Industrial and Management Optimization, 19(10): 7640–7659. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"AdaptivePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TL_JIMO23,\nauthor={Tan, Bing and Li, Songxiao},\ntitle={Adaptive inertial subgradient extragradient methods for finding minimum-norm solutions of pseudomonotone variational inequalities},\njournal={Journal of Industrial and Management Optimization},\nyear={2023},\nvolume={19},\nnumber={10},\npages={7640--7659},\ndoi={10.3934/jimo.2022060},\nurl={https://bingtan.me/files/paper/TL-JIMO2023.pdf},\nabstract={In this paper, four modified inertial subgradient extragradient methods with a new non-monotonic step size criterion are investigated for pseudomonotone variational inequality problems in real Hilbert spaces. Our algorithms employ two different step sizes in each iteration to update the values of iterative sequences, and they work well without the prior information about the Lipschitz constant of the operator. Strong convergence theorems of the proposed iterative schemes are established under some suitable and mild conditions. Some numerical examples are provided to demonstrate the computational efficiency and advantages of the proposed methods over other known ones.},\nkeywords={Variational inequality problem, Inertial method, Extragradient method, Pseudomonotone operator, Non-Lipschitz operator},\nabbrev_source_title={J. Ind. Manag. Optim.},\n}\n\n
\n
\n\n\n
\n In this paper, four modified inertial subgradient extragradient methods with a new non-monotonic step size criterion are investigated for pseudomonotone variational inequality problems in real Hilbert spaces. Our algorithms employ two different step sizes in each iteration to update the values of iterative sequences, and they work well without the prior information about the Lipschitz constant of the operator. Strong convergence theorems of the proposed iterative schemes are established under some suitable and mild conditions. Some numerical examples are provided to demonstrate the computational efficiency and advantages of the proposed methods over other known ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Zhou, Z.; Tan, B.; and Li, S.\n\n\n \n \n \n Inertial algorithms with adaptive stepsizes for split variational inclusion problems and their applications to signal recovery problem.\n \n \n\n\n \n\n\n\n Mathematical Methods in the Applied Sciences, doi:10.1002/mma.9436. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{ZTL_MMAS23,\nauthor={Zhou, Zheng and Tan, Bing and Li, Songxiao},\ntitle={Inertial algorithms with adaptive stepsizes for split variational inclusion problems and their applications to signal recovery problem},\njournal={Mathematical Methods in the Applied Sciences},\nyear={2023},\nvolume={doi:10.1002/mma.9436},\ndoi={10.1002/mma.9436},\nurl={https://bingtan.me/files/paper/ZTL-MMAS2023.pdf},\nabstract={With the help of the Meir-Keeler contraction method and the Mann-type method, two adaptive inertial iterative schemes are introduced for finding solutions of the split variational inclusion problem in Hilbert spaces. The strong convergence of the suggested algorithms is guaranteed by a new stepsize criterion that does not require calculation of the bounded linear operator norm. Some numerical experiments and applications in signal recovery problems are given to demonstrate the efficiency of the proposed algorithms.},\nkeywords={Adaptive stepsize, Inertial method, Mann method, Meir-Keeler contraction, Signal recovery, Split variational inclusion problem},\nabbrev_source_title={Math. Methods Appl. Sci.},\n}\n\n
\n
\n\n\n
\n With the help of the Meir-Keeler contraction method and the Mann-type method, two adaptive inertial iterative schemes are introduced for finding solutions of the split variational inclusion problem in Hilbert spaces. The strong convergence of the suggested algorithms is guaranteed by a new stepsize criterion that does not require calculation of the bounded linear operator norm. Some numerical experiments and applications in signal recovery problems are given to demonstrate the efficiency of the proposed algorithms.\n
\n\n\n
\n\n\n
\n \n\n \n \n Luo, Y.; Tan, B.; and Li, S.\n\n\n \n \n \n Inertial splitting algorithms for nonlinear operators of pseudocontractive and accretive types.\n \n \n\n\n \n\n\n\n Optimization, 72(3): 647–675. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{LTL_OPT23,\nauthor={Luo, Yinglin and Tan, Bing and Li, Songxiao},\ntitle={Inertial splitting algorithms for nonlinear operators of pseudocontractive and accretive types},\njournal={Optimization},\nyear={2023},\nvolume={72},\nnumber={3},\npages={647--675},\ndoi={10.1080/02331934.2021.1981896},\nurl={https://bingtan.me/files/paper/LTL-OPT2023.pdf},\nabstract={In this paper, inertial splitting algorithms for nonlinear operators of pseudocontractive and accretive types are proposed. Weak and strong convergence theorems are established in uniformly convex and $q$-uniformly smooth Banach spaces. Numerical examples are given to illustrate the effectiveness of our proposed algorithms.},\nkeywords={Accretive operator,  Banach space,  Inertial method,  Strict pseudo-contraction,  Strong convergence},\nabbrev_source_title={Optimization},\n}\n\n
\n
\n\n\n
\n In this paper, inertial splitting algorithms for nonlinear operators of pseudocontractive and accretive types are proposed. Weak and strong convergence theorems are established in uniformly convex and $q$-uniformly smooth Banach spaces. Numerical examples are given to illustrate the effectiveness of our proposed algorithms.\n
\n\n\n
\n\n\n
\n \n\n \n \n Zhou, X.; Cai, G.; Tan, B.; and Dong, Q. L.\n\n\n \n \n \n A modified generalized version of projected reflected gradient method in Hilbert spaces.\n \n \n\n\n \n\n\n\n Numerical Algorithms, doi:10.1007/s11075-023-01566-1. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{ZCTD_NUMA23,\nauthor={Zhou, Xiaolin and Cai, Gang and Tan, Bing and Dong, Qiao L.},\ntitle={A modified generalized version of projected reflected gradient method in Hilbert spaces},\njournal={Numerical Algorithms},\nyear={2023},\nvolume={doi:10.1007/s11075-023-01566-1},\ndoi={10.1007/s11075-023-01566-1},\nurl={https://bingtan.me/files/paper/ZCTD-NUMA2023.pdf},\nabstract={This article is concerned with a universal version of projected reflected gradient method with new step size for solving variational inequality problem in Hilbert spaces. Under appropriate assumptions controlled by the operators and parameters, we acquire the weak convergence of the proposed algorithm. We establish an R-linear convergence rate of our method on the condition that the relevant mapping is strongly monotone. We rework our first algorithm so that it can be simplified to several generalized methods in the literature. The efficacy and availability of our proposed iterative scheme are demonstrated in numerical experiments.},\nkeywords={Projected reflected gradient method, Variational inequality, Weak and linear convergence, Hilbert spaces},\nabbrev_source_title={Numer. Algorithms},\n}\n\n
\n
\n\n\n
\n This article is concerned with a universal version of projected reflected gradient method with new step size for solving variational inequality problem in Hilbert spaces. Under appropriate assumptions controlled by the operators and parameters, we acquire the weak convergence of the proposed algorithm. We establish an R-linear convergence rate of our method on the condition that the relevant mapping is strongly monotone. We rework our first algorithm so that it can be simplified to several generalized methods in the literature. The efficacy and availability of our proposed iterative scheme are demonstrated in numerical experiments.\n
\n\n\n
\n\n\n
\n \n\n \n \n Hu, S.; Wang, Y.; Tan, B.; and Wang, F.\n\n\n \n \n \n Inertial iterative method for solving variational inequality problems of pseudo-monotone operators and fixed point problems of nonexpansive mappings in Hilbert spaces.\n \n \n\n\n \n\n\n\n Journal of Industrial and Management Optimization, 19(4): 2655–2675. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{HWTW_JIMO23,\nauthor={Hu, Shaotao and Wang, Yuanheng and Tan, Bing and Wang, Fenghui},\ntitle={Inertial iterative method for solving variational inequality problems of pseudo-monotone operators and fixed point problems of nonexpansive mappings in {H}ilbert spaces},\njournal={Journal of Industrial and Management Optimization},\nyear={2023},\nvolume={19},\nnumber={4},\npages={2655--2675},\ndoi={10.3934/jimo.2022060},\nurl={https://bingtan.me/files/paper/HWTW-JIMO2023.pdf},\nabstract={In this paper, we propose a new inertial viscosity iterative algorithm for solving the variational inequality problem with a pseudo-monotone operator and the fixed point problem involving a nonexpansive mapping in real Hilbert spaces. The advantage of the proposed algorithm is that it can work without the prior knowledge of the Lipschitz constant of the mapping. The strong convergence of the sequence generated by the proposed algorithm is proved under some suitable assumptions imposed on the parameters. Some numerical experiments are given to support our main results.},\nkeywords={Inertial method,  Viscosity method,  Strong convergence, Variational inequality problem, Fixed point problem, Nonexpansive mapping, Pseudomonotone operator},\nabbrev_source_title={J. Ind. Manag. Optim.},\n}\n\n
\n
\n\n\n
\n In this paper, we propose a new inertial viscosity iterative algorithm for solving the variational inequality problem with a pseudo-monotone operator and the fixed point problem involving a nonexpansive mapping in real Hilbert spaces. The advantage of the proposed algorithm is that it can work without the prior knowledge of the Lipschitz constant of the mapping. The strong convergence of the sequence generated by the proposed algorithm is proved under some suitable assumptions imposed on the parameters. Some numerical experiments are given to support our main results.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Qin, X.; and Cho, S. Y.\n\n\n \n \n \n Revisiting subgradient extragradient methods for solving variational inequalities.\n \n \n\n\n \n\n\n\n Numerical Algorithms, 90(4): 1593–1615. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"RevisitingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TQC_NUMA22,\nauthor={Tan, Bing and Qin, Xiaolong and Cho, Sun Y.},\ntitle={Revisiting subgradient extragradient methods for solving variational inequalities},\njournal={Numerical Algorithms},\nyear={2022},\nvolume={90},\nnumber={4},\npages={1593--1615},\ndoi={10.1007/s11075-021-01243-1},\nurl={https://bingtan.me/files/paper/TQC-NUMA2022.pdf},\nabstract={In this paper, several extragradient algorithms with inertial effects and adaptive non-monotonic step sizes are proposed to solve pseudomonotone variational inequalities in real Hilbert spaces. The strong convergence of the proposed methods is established without the prior knowledge of the Lipschitz constant of the mapping. Some numerical experiments are given to illustrate the advantages and efficiency of the proposed schemes over previously known ones.},\nkeywords={Armijo stepsize,  Inertial extragradient method,  Non-Lipschitz operator,  Pseudomonotone operator,  Variational inequality problem},\nabbrev_source_title={Numer. Algorithms},\n}\n\n
\n
\n\n\n
\n In this paper, several extragradient algorithms with inertial effects and adaptive non-monotonic step sizes are proposed to solve pseudomonotone variational inequalities in real Hilbert spaces. The strong convergence of the proposed methods is established without the prior knowledge of the Lipschitz constant of the mapping. Some numerical experiments are given to illustrate the advantages and efficiency of the proposed schemes over previously known ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Qin, X.; and Yao, J. C.\n\n\n \n \n \n Strong convergence of inertial projection and contraction methods for pseudomonotone variational inequalities with applications to optimal control problems.\n \n \n\n\n \n\n\n\n Journal of Global Optimization, 82(3): 523–557. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"StrongPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TQY_JOGO22,\nauthor={Tan, Bing and Qin, Xiaolong and Yao, Jen C.},\ntitle={Strong convergence of inertial projection and contraction methods for pseudomonotone variational inequalities with applications to optimal control problems},\njournal={Journal of Global Optimization},\nyear={2022},\nvolume={82},\nnumber={3},\npages={523--557},\ndoi={10.1007/s10898-021-01095-y},\nurl={https://bingtan.me/files/paper/TQY-JOGO2022.pdf},\nabstract={This paper investigates some inertial projection and contraction methods for solving pseudomonotone variational inequality problems in real Hilbert spaces. The algorithms use a new non-monotonic step size so that they can work without the prior knowledge of the Lipschitz constant of the operator. Strong convergence theorems of the suggested algorithms are obtained under some suitable conditions. Some numerical experiments in finite- and infinite-dimensional spaces and applications in optimal control problems are implemented to demonstrate the performance of the suggested schemes and we also compare them with several related results.},\nkeywords={Inertial method,  Optimal control problem,  Projection and contraction method,  Pseudomonotone operator,  Subgradient extragradient method,  Variational inequality problem},\nabbrev_source_title={J. Global Optim.},\n}\n\n
\n
\n\n\n
\n This paper investigates some inertial projection and contraction methods for solving pseudomonotone variational inequality problems in real Hilbert spaces. The algorithms use a new non-monotonic step size so that they can work without the prior knowledge of the Lipschitz constant of the operator. Strong convergence theorems of the suggested algorithms are obtained under some suitable conditions. Some numerical experiments in finite- and infinite-dimensional spaces and applications in optimal control problems are implemented to demonstrate the performance of the suggested schemes and we also compare them with several related results.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Qin, X.\n\n\n \n \n \n Modified inertial projection and contraction algorithms for solving variational inequality problems with non-Lipschitz continuous operators.\n \n \n\n\n \n\n\n\n Analysis and Mathematical Physics, 12(1): 26. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"ModifiedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TQ_AMP22,\nauthor={Tan, Bing and Qin, Xiaolong},\ntitle={Modified inertial projection and contraction algorithms for solving variational inequality problems with non-Lipschitz continuous operators},\njournal={Analysis and Mathematical Physics},\nyear={2022},\nvolume={12},\nnumber={1},\ndoi={10.1007/s13324-021-00638-6},\npages={26},\nurl={https://bingtan.me/files/paper/TQ-AMP2022.pdf},\nabstract={In this paper, we present four modified inertial projection and contraction methods to solve the variational inequality problem with a pseudo-monotone and non-Lipschitz continuous operator in real Hilbert spaces. Strong convergence theorems of the proposed algorithms are established without the prior knowledge of the Lipschitz constant of the operator. Several numerical experiments and the applications to optimal control problems are provided to verify the advantages and efficiency of the proposed algorithms.},\nkeywords={Inertial method,  Projection and contraction method,  Pseudomonotone operator,  Subgradient extragradient method,  Non-Lipschitz operator,  Variational inequality problem},\nabbrev_source_title={Anal. Math. Phys.},\n}\n\n
\n
\n\n\n
\n In this paper, we present four modified inertial projection and contraction methods to solve the variational inequality problem with a pseudo-monotone and non-Lipschitz continuous operator in real Hilbert spaces. Strong convergence theorems of the proposed algorithms are established without the prior knowledge of the Lipschitz constant of the operator. Several numerical experiments and the applications to optimal control problems are provided to verify the advantages and efficiency of the proposed algorithms.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Petruşel, A.; Qin, X.; and Yao, J. C.\n\n\n \n \n \n Global and linear convergence of alternated inertial single projection algorithms for pseudo-monotone variational inequalities.\n \n \n\n\n \n\n\n\n Fixed Point Theory, 23(1): 391–426. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"GlobalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TPQY_FPT22,\nauthor={Tan, Bing and Petruşel, Adrian and Qin, Xiaolong and Yao, Jen C.},\ntitle={Global and linear convergence of alternated inertial single projection algorithms for pseudo-monotone variational inequalities},\njournal={Fixed Point Theory},\nyear={2022},\nvolume={23},\nnumber={1},\npages={391--426},\ndoi={10.24193/fpt-ro.2022.1.25},\nurl={https://bingtan.me/files/paper/TPQY-FPT2022.pdf},\nabstract={In this paper, we investigate three new relaxed single projection methods with alternating inertial extrapolation steps and adaptive non-monotonic step sizes for solving pseudo-monotone variational inequalities in real Hilbert spaces. The proposed algorithms need to compute the projection on the feasible set only once in each iteration and they can work adaptively without the prior information of the Lipschitz constant of the mapping. The weak convergence theorems of the proposed iterative schemes are established under some appropriate conditions imposed on the parameters. These methods recover the Fejér monotonicity of the even subsequence with respect to the solution and obtain linear convergence rates. Finally, some numerical experiments and applications to optimal control problems are provided to demonstrate the advantages and efficiency of the proposed methods compared to some recent related ones.},\nkeywords={Adaptive stepsize,  Alternated inertial method,  Projection and contraction method,  Pseudomonotone operator,  Subgradient extragradient method,  Variational inequality problem},\nabbrev_source_title={Fixed Point Theory},\n}\n\n
\n
\n\n\n
\n In this paper, we investigate three new relaxed single projection methods with alternating inertial extrapolation steps and adaptive non-monotonic step sizes for solving pseudo-monotone variational inequalities in real Hilbert spaces. The proposed algorithms need to compute the projection on the feasible set only once in each iteration and they can work adaptively without the prior information of the Lipschitz constant of the mapping. The weak convergence theorems of the proposed iterative schemes are established under some appropriate conditions imposed on the parameters. These methods recover the Fejér monotonicity of the even subsequence with respect to the solution and obtain linear convergence rates. Finally, some numerical experiments and applications to optimal control problems are provided to demonstrate the advantages and efficiency of the proposed methods compared to some recent related ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Qin, X.\n\n\n \n \n \n Adaptive modified inertial projection and contraction methods for pseudomonotone variational inequalities.\n \n \n\n\n \n\n\n\n Journal of Applied and Numerical Optimization, 4(2): 221–243. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"AdaptivePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TQ_JANO22,\nauthor={Tan, Bing and Qin, Xiaolong},\ntitle={Adaptive modified inertial projection and contraction methods for pseudomonotone variational inequalities},\njournal={Journal of Applied and Numerical Optimization},\nyear={2022},\nvolume={4},\nnumber={2},\npages={221--243},\ndoi={10.23952/jano.4.2022.2.08},\nurl={https://bingtan.me/files/paper/TQ-JANO2022.pdf},\nabstract={To handle pseudomonotone variational inequality problems in real Hilbert spaces, four modified inertial projection and contraction algorithms with non-monotonic step sizes are suggested in this paper. The proposed algorithms take advantage of a novel non-monotonic step size criteria, allowing them to work without previous knowledge of the Lipschitz constant of the mapping involved. Under certain situations, the strong convergence of the iterative sequences generated by the suggested algorithms is established. Finally, several numerical experiments are offered to validate the theoretical conclusions.},\nkeywords={Inertial method, Pseudomonotone operator, Projection and contraction method, Subgradient extragradient method, Variational inequality problem},\nabbrev_source_title={J. Appl. Numer. Optim.},\n}\n\n
\n
\n\n\n
\n To handle pseudomonotone variational inequality problems in real Hilbert spaces, four modified inertial projection and contraction algorithms with non-monotonic step sizes are suggested in this paper. The proposed algorithms take advantage of a novel non-monotonic step size criteria, allowing them to work without previous knowledge of the Lipschitz constant of the mapping involved. Under certain situations, the strong convergence of the iterative sequences generated by the suggested algorithms is established. Finally, several numerical experiments are offered to validate the theoretical conclusions.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Qin, X.\n\n\n \n \n \n Self adaptive viscosity-type inertial extragradient algorithms for solving variational inequalities with applications.\n \n \n\n\n \n\n\n\n Mathematical Modelling and Analysis, 27(1): 41–58. 2022.\n \n\n(ESI Highly Cited Paper)\n\n
\n\n\n\n \n \n \"SelfPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TQ_MMA22,\nauthor={Tan, Bing and Qin, Xiaolong},\ntitle={Self adaptive viscosity-type inertial extragradient algorithms for solving variational inequalities with applications},\njournal={Mathematical Modelling and Analysis},\nyear={2022},\nvolume={27},\nnumber={1},\npages={41--58},\ndoi={10.3846/mma.2022.13846},\nurl={https://bingtan.me/files/paper/TQ-MMA2022.pdf},\nabstract={In this paper, we introduce two new inertial extragradient algorithms with non-monotonic stepsizes for solving monotone and Lipschitz continuous variational inequality problems in real Hilbert spaces. Strong convergence theorems of the suggested iterative schemes are established without the prior knowledge of the Lipschitz constant of the mapping. Finally, some numerical examples are provided to illustrate the efficiency and advantages of the proposed algorithms and compare them with some related ones.},\nkeywords={Inertial method, Subgradient extragradient method,  Tseng's extragradient method,  Optimal control problem,  Variational inequality problem,  Viscosity method},\nabbrev_source_title={Math. Model. Anal.},\nbibbase_note={<span style="color: red">(<s>ESI Highly Cited Paper</s>)</span>},\n}\n\n
\n
\n\n\n
\n In this paper, we introduce two new inertial extragradient algorithms with non-monotonic stepsizes for solving monotone and Lipschitz continuous variational inequality problems in real Hilbert spaces. Strong convergence theorems of the suggested iterative schemes are established without the prior knowledge of the Lipschitz constant of the mapping. Finally, some numerical examples are provided to illustrate the efficiency and advantages of the proposed algorithms and compare them with some related ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Liu, L.; and Qin, X.\n\n\n \n \n \n Strong convergence of inertial extragradient algorithms for solving variational inequalities and fixed point problems.\n \n \n\n\n \n\n\n\n Fixed Point Theory, 23(2): 707–728. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"StrongPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TLQ_FPT22,\nauthor={Tan, Bing and Liu, Liya and Qin, Xiaolong},\ntitle={Strong convergence of inertial extragradient algorithms for solving variational inequalities and fixed point problems},\njournal={Fixed Point Theory},\nyear={2022},\nvolume={23},\nnumber={2},\npages={707--728},\ndoi={10.24193/fpt-ro.2022.2.17},\nurl={https://bingtan.me/files/paper/TLQ-FPT2022.pdf},\nabstract={This paper investigates two inertial extragradient algorithms for seeking a common solution to a variational inequality problem involving a monotone and Lipschitz continuous mapping and a fixed point problem with a demicontractive mapping in real Hilbert spaces. Our algorithms need to calculate the projection on the feasible set only once in each iteration. Moreover, they can work well without the prior information of the Lipschitz constant of the operator and do not contain any linesearch process. Strong convergence theorems of the suggested algorithms are established under suitable conditions. Some experiments are presented to illustrate the numerical efficiency of the suggested algorithms and compare them with some existing ones.},\nkeywords={Variational inequality problem, Fixed point problem, Subgradient extragradient method, Tseng's extragradient method, Inertial method, Demicontractive mapping},\nabbrev_source_title={Fixed Point Theory},\n}\n\n
\n
\n\n\n
\n This paper investigates two inertial extragradient algorithms for seeking a common solution to a variational inequality problem involving a monotone and Lipschitz continuous mapping and a fixed point problem with a demicontractive mapping in real Hilbert spaces. Our algorithms need to calculate the projection on the feasible set only once in each iteration. Moreover, they can work well without the prior information of the Lipschitz constant of the operator and do not contain any linesearch process. Strong convergence theorems of the suggested algorithms are established under suitable conditions. Some experiments are presented to illustrate the numerical efficiency of the suggested algorithms and compare them with some existing ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Li, S.\n\n\n \n \n \n Modified inertial projection and contraction algorithms with non-monotonic step sizes for solving variational inequalities and their applications.\n \n \n\n\n \n\n\n\n Optimization, doi:10.1080/02331934.2022.2123705. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"ModifiedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TL_OPT22,\nauthor={Tan, Bing and Li, Songxiao},\ntitle={Modified inertial projection and contraction algorithms with non-monotonic step sizes for solving variational inequalities and their applications},\njournal={Optimization},\nyear={2022},\nvolume={doi:10.1080/02331934.2022.2123705},\ndoi={10.1080/02331934.2022.2123705},\nurl={https://bingtan.me/files/paper/TL-OPT2022.pdf},\nabstract={We present two adaptive inertial projection and contraction algorithms to discover the minimum-norm solutions of pseudomonotone variational inequality problems in real Hilbert spaces. The suggested algorithms employ two different step sizes in each iteration and use a non-monotone step size criterion without any line search allowing them to work adaptively. The strong convergence of the iterative sequences formed by the proposed algorithms is established under some mild conditions. Several numerical experiments occurring in finite- and infinite-dimensional Hilbert spaces and applications to optimal control problems as well as signal processing problems are given. Performance profiles are used to verify the computational efficiency and advantages of the proposed algorithms with respect to some known ones.},\nkeywords={Variational inequality problem,  Inertial method,  Projection and contraction method,  Subgradient extragradient method, Pseudomonotone operator, Optimal control problem, Signal processing problem, Strong convergence},\nabbrev_source_title={Optimization},\n}\n\n
\n
\n\n\n
\n We present two adaptive inertial projection and contraction algorithms to discover the minimum-norm solutions of pseudomonotone variational inequality problems in real Hilbert spaces. The suggested algorithms employ two different step sizes in each iteration and use a non-monotone step size criterion without any line search allowing them to work adaptively. The strong convergence of the iterative sequences formed by the proposed algorithms is established under some mild conditions. Several numerical experiments occurring in finite- and infinite-dimensional Hilbert spaces and applications to optimal control problems as well as signal processing problems are given. Performance profiles are used to verify the computational efficiency and advantages of the proposed algorithms with respect to some known ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Li, S.\n\n\n \n \n \n Revisiting projection and contraction algorithms for solving variational inequalities and applications.\n \n \n\n\n \n\n\n\n Applied Set-Valued Analysis and Optimization, 4(2): 167–183. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"RevisitingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TL_ASVAO22,\nauthor={Tan, Bing and Li, Songxiao},\ntitle={Revisiting projection and contraction algorithms for solving variational inequalities and applications},\njournal={Applied Set-Valued Analysis and Optimization},\nyear={2022},\nvolume={4},\nnumber={2},\npages={167--183},\ndoi={10.23952/asvao.4.2022.2.03},\nurl={https://bingtan.me/files/paper/TL-ASVAO2022.pdf},\nabstract={We provide two novel projection and contraction algorithms to find the minimum-norm solution of the variational inequality problem with a pseudo monotone and non-Lipschitz continuous operator in a real Hilbert space. Our algorithms can work adaptively without requiring the prior information of the Lipschitz constant of the operator. Strong convergence theorems for the suggested iterative algorithms are established under suitable conditions. Some numerical experiments are discussed to demonstrate the computational efficiency of the proposed algorithms in comparison with several existing ones.},\nkeywords={Variational inequality problem, Subgradient extragradient method, Projection and contraction method, Inertial method, Pseudomonotone operator},\nabbrev_source_title={Appl. Set-Valued Anal. Optim.},\n}\n\n
\n
\n\n\n
\n We provide two novel projection and contraction algorithms to find the minimum-norm solution of the variational inequality problem with a pseudo monotone and non-Lipschitz continuous operator in a real Hilbert space. Our algorithms can work adaptively without requiring the prior information of the Lipschitz constant of the operator. Strong convergence theorems for the suggested iterative algorithms are established under suitable conditions. Some numerical experiments are discussed to demonstrate the computational efficiency of the proposed algorithms in comparison with several existing ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Zhou, Z.; and Li, S.\n\n\n \n \n \n Viscosity-type inertial extragradient algorithms for solving variational inequality problems and fixed point problems.\n \n \n\n\n \n\n\n\n Journal of Applied Mathematics and Computing, 68(2): 1387–1411. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"Viscosity-typePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TZL_JAMC22,\nauthor={Tan, Bing and Zhou, Zheng and Li, Songxiao},\ntitle={Viscosity-type inertial extragradient algorithms for solving variational inequality problems and fixed point problems},\njournal={Journal of Applied Mathematics and Computing},\nyear={2022},\nvolume={68},\nnumber={2},\npages={1387--1411},\ndoi={10.1007/s12190-021-01576-z},\nurl={https://bingtan.me/files/paper/TZL-JAMC2022.pdf},\nabstract={The paper presents two inertial viscosity-type extragradient algorithms for finding a common solution of the variational inequality problem involving a monotone and Lipschitz continuous operator and of the fixed point problem with a demicontractive mapping in real Hilbert spaces. Our algorithms use a simple step size rule which is generated by some calculations at each iteration. Two strong convergence theorems are obtained without the prior knowledge of the Lipschitz constant of the operator. The numerical behaviors of the proposed algorithms in some numerical experiments are reported and compared with previously known ones.},\nkeywords={Fixed point problem,  Inertial method,  Subgradient extragradient method,  Tseng's extragradient method,  Variational inequality problem},\nabbrev_source_title={J. Appl. Math. Comput.},\n}\n\n
\n
\n\n\n
\n The paper presents two inertial viscosity-type extragradient algorithms for finding a common solution of the variational inequality problem involving a monotone and Lipschitz continuous operator and of the fixed point problem with a demicontractive mapping in real Hilbert spaces. Our algorithms use a simple step size rule which is generated by some calculations at each iteration. Two strong convergence theorems are obtained without the prior knowledge of the Lipschitz constant of the operator. The numerical behaviors of the proposed algorithms in some numerical experiments are reported and compared with previously known ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Li, S.; and Cho, S. Y.\n\n\n \n \n \n Revisiting inertial subgradient extragradient algorithms for solving bilevel variational inequality problems.\n \n \n\n\n \n\n\n\n Journal of Applied and Numerical Optimization, 4(3): 425–444. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"RevisitingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TLC_JANO22,\nauthor={Tan, Bing and Li, Songxiao and Cho, Sun Y.},\ntitle={Revisiting inertial subgradient extragradient algorithms for solving bilevel variational inequality problems},\njournal={Journal of Applied and Numerical Optimization},\nyear={2022},\nvolume={4},\nnumber={3},\npages={425--444},\ndoi={10.23952/jano.4.2022.3.08},\nurl={https://bingtan.me/files/paper/TLC-JANO2022.pdf},\nabstract={In this paper, four modified subgradient extragradient algorithms are proposed for solving bilevel pseudomonotone variational inequality problems in real Hilbert spaces. The proposed algorithms can work adaptively without the prior knowledge of the Lipschitz constant of the pseudomonotone mapping. Strong convergence theorems for the suggested algorithms are established under suitable and mild conditions. Finally, some numerical experiments and applications are performed to verify the efficiency of the proposed algorithms with respect to some previously known ones.},\nkeywords={Inertial method, Pseudomonotone operator, Subgradient extragradient method, Bilevel variational inequality problem},\nabbrev_source_title={J. Appl. Numer. Optim.},\n}\n\n
\n
\n\n\n
\n In this paper, four modified subgradient extragradient algorithms are proposed for solving bilevel pseudomonotone variational inequality problems in real Hilbert spaces. The proposed algorithms can work adaptively without the prior knowledge of the Lipschitz constant of the pseudomonotone mapping. Strong convergence theorems for the suggested algorithms are established under suitable and mild conditions. Finally, some numerical experiments and applications are performed to verify the efficiency of the proposed algorithms with respect to some previously known ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Cho, S. Y.; and Yao, J. C.\n\n\n \n \n \n Accelerated inertial subgradient extragradient algorithms with non-monotonic step sizes for equilibrium problems and fixed point problems.\n \n \n\n\n \n\n\n\n Journal of Nonlinear and Variational Analysis, 6(1): 89–122. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"AcceleratedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TCY_JNVA22,\nauthor={Tan, Bing and Cho, Sun Y. and Yao, Jen C.},\ntitle={Accelerated inertial subgradient extragradient algorithms with non-monotonic step sizes for equilibrium problems and fixed point problems},\njournal={Journal of Nonlinear and Variational Analysis},\nyear={2022},\nvolume={6},\nnumber={1},\npages={89--122},\ndoi={10.23952/jnva.6.2022.1.06},\nurl={https://bingtan.me/files/paper/TCY-JNVA2022.pdf},\nabstract={This paper introduces several new accelerated subgradient extragradient methods with inertial effects for approximating a solution of a pseudomonotone equilibrium problem and a fixed point problem involving a quasi-nonexpansive mapping or a demicontractive mapping in real Hilbert spaces. The proposed algorithms use an adaptive non-monotonic step size criterion that does not include any Armijo line search process. Strong convergence theorems of the suggested iterative algorithms are established without the prior knowledge of the Lipschitz constants of the bifunction. Moreover, $R$-linear convergence is guaranteed under the assumption that the bifunction satisfies strong pseudomonotonicity. Applications to variational inequality problems are also considered. Finally, some numerical examples and applications, which demonstrate the advantages and efficiency of the proposed algorithms, are given.},\nkeywords={Equilibrium problem,  Fixed point problem,  Inertial method,  Pseudomonotone bifunction,  Subgradient extragradient method},\nabbrev_source_title={J. Nonlinear Var. Anal.},\n}\n\n
\n
\n\n\n
\n This paper introduces several new accelerated subgradient extragradient methods with inertial effects for approximating a solution of a pseudomonotone equilibrium problem and a fixed point problem involving a quasi-nonexpansive mapping or a demicontractive mapping in real Hilbert spaces. The proposed algorithms use an adaptive non-monotonic step size criterion that does not include any Armijo line search process. Strong convergence theorems of the suggested iterative algorithms are established without the prior knowledge of the Lipschitz constants of the bifunction. Moreover, $R$-linear convergence is guaranteed under the assumption that the bifunction satisfies strong pseudomonotonicity. Applications to variational inequality problems are also considered. Finally, some numerical examples and applications, which demonstrate the advantages and efficiency of the proposed algorithms, are given.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Cho, S. Y.\n\n\n \n \n \n Two adaptive modified subgradient extragradient methods for bilevel pseudomonotone variational inequalities with applications.\n \n \n\n\n \n\n\n\n Communications in Nonlinear Science and Numerical Simulation, 107: 106160. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"TwoPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TC_CNSNS22,\nauthor={Tan, Bing and Cho, Sun Y.},\ntitle={Two adaptive modified subgradient extragradient methods for bilevel pseudomonotone variational inequalities with applications},\njournal={Communications in Nonlinear Science and Numerical Simulation},\nyear={2022},\nvolume={107},\ndoi={10.1016/j.cnsns.2021.106160},\npages={106160},\nurl={https://bingtan.me/files/paper/TC-CNSNS2022.pdf},\nabstract={We consider the bilevel variational inequality problem with a pseudomonotone operator in real Hilbert spaces and investigate two modified subgradient extragradient methods with inertial terms. Our first scheme requires the operator to be Lipschitz continuous (the Lipschitz constant does not need to be known) while the second one only requires it to be uniformly continuous. The proposed methods employ two adaptive stepsizes making them work without the prior knowledge of the Lipschitz constant of the mapping. The strong convergence properties of the iterative sequences generated by the proposed algorithms are obtained under mild conditions. Some numerical tests and applications are given to demonstrate the advantages and efficiency of the stated schemes over previously known ones.},\nkeywords={Adaptive stepsize,  Bilevel variational inequality problem,  Extragradient method,  Inertial method,  Pseudomonotone operator},\nabbrev_source_title={Comm. Nonlinear Sci. Numer. Simul.},\n}\n\n
\n
\n\n\n
\n We consider the bilevel variational inequality problem with a pseudomonotone operator in real Hilbert spaces and investigate two modified subgradient extragradient methods with inertial terms. Our first scheme requires the operator to be Lipschitz continuous (the Lipschitz constant does not need to be known) while the second one only requires it to be uniformly continuous. The proposed methods employ two adaptive stepsizes making them work without the prior knowledge of the Lipschitz constant of the mapping. The strong convergence properties of the iterative sequences generated by the proposed algorithms are obtained under mild conditions. Some numerical tests and applications are given to demonstrate the advantages and efficiency of the stated schemes over previously known ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Cho, S. Y.\n\n\n \n \n \n Two projection-based methods for bilevel pseudomonotone variational inequalities involving non-Lipschitz operators.\n \n \n\n\n \n\n\n\n Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas, 116(2): 64. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"TwoPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TC_RCSM22,\nauthor={Tan, Bing and Cho, Sun Y.},\ntitle={Two projection-based methods for bilevel pseudomonotone variational inequalities involving non-Lipschitz operators},\njournal={Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas},\nyear={2022},\nvolume={116},\nnumber={2},\ndoi={10.1007/s13398-021-01205-1},\npages={64},\nurl={https://bingtan.me/files/paper/TC-RACSAM2022.pdf},\nabstract={In this paper, we propose two new iterative algorithms to discover solutions of bilevel pseudomonotone variational inequalities with non-Lipschitz continuous operators in real Hilbert spaces. Our proposed algorithms need to compute the projection on the feasible set only once in each iteration although they employ Armijo line search methods. Strong convergence theorems of the suggested algorithms are established under suitable and weaker conditions. Some numerical experiments and applications are given to demonstrate the performance of the offered algorithms compared to some known ones.},\nkeywords={Armijo stepsize,  Bilevel variational inequality problem,  Inertial method,  Non-Lipschitz operator,  Pseudomonotone operator},\nabbrev_source_title={Rev. R. Acad. Cienc. Exactas F{\\' i}s. Nat. Ser. A Mat. RACSAM},\n}\n\n
\n
\n\n\n
\n In this paper, we propose two new iterative algorithms to discover solutions of bilevel pseudomonotone variational inequalities with non-Lipschitz continuous operators in real Hilbert spaces. Our proposed algorithms need to compute the projection on the feasible set only once in each iteration although they employ Armijo line search methods. Strong convergence theorems of the suggested algorithms are established under suitable and weaker conditions. Some numerical experiments and applications are given to demonstrate the performance of the offered algorithms compared to some known ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Cho, S. Y.\n\n\n \n \n \n Strong convergence of inertial forward-backward methods for solving monotone inclusions.\n \n \n\n\n \n\n\n\n Applicable Analysis, 101(15): 5386–5414. 2022.\n \n\n(ESI Highly Cited Paper)\n\n
\n\n\n\n \n \n \"StrongPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TC_AA22,\nauthor={Tan, Bing and Cho, Sun Y.},\ntitle={Strong convergence of inertial forward-backward methods for solving monotone inclusions},\njournal={Applicable Analysis},\nyear={2022},\nvolume={101},\nnumber={15},\npages={5386--5414},\ndoi={10.1080/00036811.2021.1892080},\nurl={https://bingtan.me/files/paper/TC-AA2022.pdf},\nabstract={The paper presents four modifications of the inertial forward–backward splitting method for monotone inclusion problems in the framework of real Hilbert spaces. The advantages of our iterative schemes are that the single-valued operator is Lipschitz continuous monotone rather than cocoercive and the Lipschitz constant does not require to be known. The strong convergence of the suggested approaches is obtained under some standard and mild conditions. Finally, several numerical experiments in finite- and infinite-dimensional spaces are proposed to demonstrate the advantages of our algorithms over the existing related ones.},\nkeywords={Inclusion problem,  Inertial forward–backward method,  Projection and contraction method,  Tseng's extragradient method,  Viscosity method, Signal processing problem},\nabbrev_source_title={Appl. Anal.},\nbibbase_note={<span style="color: red">(ESI Highly Cited Paper)</span>},\n}\n\n
\n
\n\n\n
\n The paper presents four modifications of the inertial forward–backward splitting method for monotone inclusion problems in the framework of real Hilbert spaces. The advantages of our iterative schemes are that the single-valued operator is Lipschitz continuous monotone rather than cocoercive and the Lipschitz constant does not require to be known. The strong convergence of the suggested approaches is obtained under some standard and mild conditions. Finally, several numerical experiments in finite- and infinite-dimensional spaces are proposed to demonstrate the advantages of our algorithms over the existing related ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Cho, S. Y.\n\n\n \n \n \n Inertial extragradient algorithms with non-monotone stepsizes for pseudomonotone variational inequalities and applications.\n \n \n\n\n \n\n\n\n Computational and Applied Mathematics, 41(3): 121. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TC_COAM22,\nauthor={Tan, Bing and Cho, Sun Y.},\ntitle={Inertial extragradient algorithms with non-monotone stepsizes for pseudomonotone variational inequalities and applications},\njournal={Computational and Applied Mathematics},\nyear={2022},\nvolume={41},\nnumber={3},\ndoi={10.1007/s40314-022-01819-0},\npages={121},\nurl={https://bingtan.me/files/paper/TC-COAM2022.pdf},\nabstract={The goal of this paper is to construct several fast iterative algorithms for solving pseudomonotone variational inequalities in real Hilbert spaces. We introduce two extragradient algorithms with inertial terms and give a strong convergence analysis under suitable assumptions. The suggested algorithms need to compute the projection on the feasible set only once in each iteration and can update the step size adaptively without any line search condition. Some numerical experiments and applications are implemented to illustrate the advantages and efficiency of the suggested algorithms over the related known methods.},\nkeywords={Inertial method,  Pseudomonotone operator,  Subgradient extragradient method,  Tseng's extragradient method,  Variational inequality problem},\nabbrev_source_title={Comput. Appl. Math.},\n}\n\n
\n
\n\n\n
\n The goal of this paper is to construct several fast iterative algorithms for solving pseudomonotone variational inequalities in real Hilbert spaces. We introduce two extragradient algorithms with inertial terms and give a strong convergence analysis under suitable assumptions. The suggested algorithms need to compute the projection on the feasible set only once in each iteration and can update the step size adaptively without any line search condition. Some numerical experiments and applications are implemented to illustrate the advantages and efficiency of the suggested algorithms over the related known methods.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Cho, S. Y.\n\n\n \n \n \n Two new projection algorithms for variational inequalities in Hilbert spaces.\n \n \n\n\n \n\n\n\n Journal of Nonlinear and Convex Analysis, 23(11): 2523–2534. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"TwoPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TC_JNCA22,\nauthor={Tan, Bing and Cho, Sun Y.},\ntitle={Two new projection algorithms for variational inequalities in Hilbert spaces},\njournal={Journal of Nonlinear and Convex Analysis},\nyear={2022},\nvolume={23},\nnumber={11},\npages={2523--2534},\nurl={https://bingtan.me/files/paper/TC-JNCA2022.pdf},\nabstract={In this paper, two new projection-type algorithms are introduced for solving pseudomonotone variational inequalities in real Hilbert spaces. The proposed methods use two non-monotonic step sizes allowing them to work adaptively without the prior information of the Lipschitz constant of the operator. Strong convergence theorems for the proposed methods are established under suitable conditions. A fundamental numerical example is given to verify the efficiency of the suggested methods in comparison with some known ones.},\nkeywords={Inertial method, Pseudomonotone operator,  Variational inequality problem, Projection method},\nabbrev_source_title={J. Nonlinear Convex Anal.},\n}\n\n
\n
\n\n\n
\n In this paper, two new projection-type algorithms are introduced for solving pseudomonotone variational inequalities in real Hilbert spaces. The proposed methods use two non-monotonic step sizes allowing them to work adaptively without the prior information of the Lipschitz constant of the operator. Strong convergence theorems for the proposed methods are established under suitable conditions. A fundamental numerical example is given to verify the efficiency of the suggested methods in comparison with some known ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Zhou, Z.; Tan, B.; and Li, S.\n\n\n \n \n \n Adaptive hybrid steepest descent algorithms involving an inertial extrapolation term for split monotone variational inclusion problems.\n \n \n\n\n \n\n\n\n Mathematical Methods in the Applied Sciences, 45(15): 8835–8853. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"AdaptivePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{ZTL_MMAS22,\nauthor={Zhou, Zheng and Tan, Bing and Li, Songxiao},\ntitle={Adaptive hybrid steepest descent algorithms involving an inertial extrapolation term for split monotone variational inclusion problems},\njournal={Mathematical Methods in the Applied Sciences},\nyear={2022},\nvolume={45},\nnumber={15},\npages={8835--8853},\ndoi={10.1002/mma.7931},\nurl={https://bingtan.me/files/paper/ZTL-MMAS2022.pdf},\nabstract={In this paper, we discuss the split monotone variational inclusion problem and propose two new inertial algorithms in infinite-dimensional Hilbert spaces. The iterative sequence by the proposed algorithms converges strongly to the solution of a certain variational inequality with the help of the hybrid steepest descent method. Furthermore, an adaptive step size criterion is considered in suggested algorithms to avoid the difficulty of calculating the operator norm. Meanwhile, our results are also applied to several other types of split problems. Finally, some numerical experiments show that our algorithms are realistic and summarize the known results.},\nkeywords={Adaptive stepsize,  Hybrid steepest descent method,  Inertial method,  Signal processing problem,  Strong convergence},\nabbrev_source_title={Math. Methods Appl. Sci.},\n}\n\n
\n
\n\n\n
\n In this paper, we discuss the split monotone variational inclusion problem and propose two new inertial algorithms in infinite-dimensional Hilbert spaces. The iterative sequence by the proposed algorithms converges strongly to the solution of a certain variational inequality with the help of the hybrid steepest descent method. Furthermore, an adaptive step size criterion is considered in suggested algorithms to avoid the difficulty of calculating the operator norm. Meanwhile, our results are also applied to several other types of split problems. Finally, some numerical experiments show that our algorithms are realistic and summarize the known results.\n
\n\n\n
\n\n\n
\n \n\n \n \n Zhou, Z.; Tan, B.; and Cho, S. Y.\n\n\n \n \n \n Alternated inertial subgradient extragradient methods for solving variational inequalities.\n \n \n\n\n \n\n\n\n Journal of Nonlinear and Convex Analysis, 23(11): 2593–2604. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"AlternatedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{ZTC_JNCA22,\nauthor={Zhou, Zheng and Tan, Bing and Cho, Sun Y.},\ntitle={Alternated inertial subgradient extragradient methods for solving variational inequalities},\njournal={Journal of Nonlinear and Convex Analysis},\nyear={2022},\nvolume={23},\nnumber={11},\npages={2593--2604},\nurl={https://bingtan.me/files/paper/ZTC-JNCA2022.pdf},\nabstract={The goal of this paper is to study some iterative algorithms for solving a pseudomonotone variational inequality in Hilbert spaces. The iterative algorithms presented in this paper are based on the alternated inertial method and the subgradient extragradient method. Weak convergence of the algorithms is established by the adaptive stepsize criterion in Hilbert spaces.},\nkeywords={Alternated inertial method, Pseudomonotone operator,  Variational inequality problem, Subgradient extragradient method},\nabbrev_source_title={J. Nonlinear Convex Anal.},\n}\n\n
\n
\n\n\n
\n The goal of this paper is to study some iterative algorithms for solving a pseudomonotone variational inequality in Hilbert spaces. The iterative algorithms presented in this paper are based on the alternated inertial method and the subgradient extragradient method. Weak convergence of the algorithms is established by the adaptive stepsize criterion in Hilbert spaces.\n
\n\n\n
\n\n\n
\n \n\n \n \n Zhou, Z.; Tan, B.; and Li, S.\n\n\n \n \n \n Two self-adaptive inertial projection algorithms for solving split variational inclusion problems.\n \n \n\n\n \n\n\n\n AIMS Mathematics, 7(4): 4960–4973. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"TwoPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{ZTL_AIMS22,\nauthor={Zhou, Zheng and Tan, Bing and Li, Songxiao},\ntitle={Two self-adaptive inertial projection algorithms for solving split variational inclusion problems},\njournal={AIMS Mathematics},\nyear={2022},\nvolume={7},\nnumber={4},\npages={4960--4973},\ndoi={10.3934/math.2022276},\nurl={https://bingtan.me/files/paper/ZTL-AIMS2022.pdf},\nabstract={This paper is to analyze the approximation solution of a split variational inclusion problem in the framework of Hilbert spaces. For this purpose, inertial hybrid and shrinking projection algorithms are proposed under the effect of a self-adaptive stepsize which does not require information of the norms of the given operators. The strong convergence properties of the proposed algorithms are obtained under mild constraints. Finally, a numerical experiment is given to illustrate the performance of proposed methods and to compare our algorithms with an existing algorithm.},\nkeywords={Inertial method,  Adaptive stepsize,  Split variational inclusion problem},\nabbrev_source_title={AIMS Math.},\n}\n\n
\n
\n\n\n
\n This paper is to analyze the approximation solution of a split variational inclusion problem in the framework of Hilbert spaces. For this purpose, inertial hybrid and shrinking projection algorithms are proposed under the effect of a self-adaptive stepsize which does not require information of the norms of the given operators. The strong convergence properties of the proposed algorithms are obtained under mild constraints. Finally, a numerical experiment is given to illustrate the performance of proposed methods and to compare our algorithms with an existing algorithm.\n
\n\n\n
\n\n\n
\n \n\n \n \n Fan, J.; Qin, X.; and Tan, B.\n\n\n \n \n \n Tseng's extragradient algorithm for pseudomonotone variational inequalities on Hadamard manifolds.\n \n \n\n\n \n\n\n\n Applicable Analysis, 101(6): 2372–2385. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"Tseng'sPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{FQT_AA22,\nauthor={Fan, Jingjing and Qin, Xiaolong and Tan, Bing},\ntitle={Tseng's extragradient algorithm for pseudomonotone variational inequalities on {H}adamard manifolds},\njournal={Applicable Analysis},\nyear={2022},\nvolume={101},\nnumber={6},\npages={2372--2385},\ndoi={10.1080/00036811.2020.1807012},\nurl={https://bingtan.me/files/paper/FQT-AA2022.pdf},\nabstract={In this paper, we investigate the Tseng's extragradient algorithm for non-Lipschitzian variational inequalities with pseudomonotone vector fields on Hadamard manifolds. The convergence analysis of the proposed algorithm is discussed under mild assumptions. Two experiments are provided to illustrate the asymptotical behavior of the algorithm. The results presented in this paper generalize some known results presented in the literature.},\nkeywords={Extragradient method,  Hadamard manifolds,  Non-Lipschitz operator,  Pseudomonotone vector field,  Variational inequality problem},\nabbrev_source_title={Appl. Anal.},\n}\n\n
\n
\n\n\n
\n In this paper, we investigate the Tseng's extragradient algorithm for non-Lipschitzian variational inequalities with pseudomonotone vector fields on Hadamard manifolds. The convergence analysis of the proposed algorithm is discussed under mild assumptions. Two experiments are provided to illustrate the asymptotical behavior of the algorithm. The results presented in this paper generalize some known results presented in the literature.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Qin, X.; and Yao, J. C.\n\n\n \n \n \n Strong convergence of self-adaptive inertial algorithms for solving split variational inclusion problems with applications.\n \n \n\n\n \n\n\n\n Journal of Scientific Computing, 87(1): 20. 2021.\n \n\n(ESI Highly Cited Paper)\n\n
\n\n\n\n \n \n \"StrongPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TQY_JSC21,\nauthor={Tan, Bing and Qin, Xiaolong and Yao, Jen C.},\ntitle={Strong convergence of self-adaptive inertial algorithms for solving split variational inclusion problems with applications},\njournal={Journal of Scientific Computing},\nyear={2021},\nvolume={87},\nnumber={1},\ndoi={10.1007/s10915-021-01428-9},\npages={20},\nurl={https://bingtan.me/files/paper/TQY-JSC2021.pdf},\nabstract={In this paper, four self-adaptive iterative algorithms with inertial effects are introduced to solve a split variational inclusion problem in real Hilbert spaces. One of the advantages of the suggested algorithms is that they can work without knowing the prior information of the operator norm. Strong convergence theorems of these algorithms are established under mild and standard assumptions. As applications, the split feasibility problem and the split minimization problem in real Hilbert spaces are studied. Finally, several preliminary numerical experiments as well as an example in the field of compressed sensing are proposed to support the advantages and efficiency of the suggested methods over some existing ones.},\nkeywords={Inertial method,  Mann method,  Signal processing problem,  Split variational inclusion problem,  Strong convergence,  Viscosity method},\nabbrev_source_title={J. Sci. Comput.},\nbibbase_note={<span style="color: red">(ESI Highly Cited Paper)</span>},\n}\n\n
\n
\n\n\n
\n In this paper, four self-adaptive iterative algorithms with inertial effects are introduced to solve a split variational inclusion problem in real Hilbert spaces. One of the advantages of the suggested algorithms is that they can work without knowing the prior information of the operator norm. Strong convergence theorems of these algorithms are established under mild and standard assumptions. As applications, the split feasibility problem and the split minimization problem in real Hilbert spaces are studied. Finally, several preliminary numerical experiments as well as an example in the field of compressed sensing are proposed to support the advantages and efficiency of the suggested methods over some existing ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Qin, X.; and Yao, J. C.\n\n\n \n \n \n Two modified inertial projection algorithms for bilevel pseudomonotone variational inequalities with applications to optimal control problems.\n \n \n\n\n \n\n\n\n Numerical Algorithms, 88(4): 1757–1786. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"TwoPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TQY_NUMA21,\nauthor={Tan, Bing and Qin, Xiaolong and Yao, Jen C.},\ntitle={Two modified inertial projection algorithms for bilevel pseudomonotone variational inequalities with applications to optimal control problems},\njournal={Numerical Algorithms},\nyear={2021},\nvolume={88},\nnumber={4},\npages={1757--1786},\ndoi={10.1007/s11075-021-01093-x},\nurl={https://bingtan.me/files/paper/TQY-NUMA2021.pdf},\nabstract={In this paper, we investigate two new algorithms for solving bilevel pseudomonotone variational inequality problems in real Hilbert spaces. The advantages of our algorithms are that they only need to calculate one projection on the feasible set in each iteration, and do not require the prior information of the Lipschitz constant of the cost operator. Furthermore, two new algorithms are derived to solve variational inequality problems. We establish the strong convergence of the proposed algorithms under some suitable conditions imposed on parameters. Finally, several numerical results and applications in optimal control problems are reported to illustrate the efficiency and advantages of the proposed algorithms.},\nkeywords={Bilevel variational inequality problem,  Hybrid steepest descent method,  Inertial extragradient method,  Projection and contraction method,  Pseudomonotone operator},\nabbrev_source_title={Numer. Algorithms},\n}\n\n
\n
\n\n\n
\n In this paper, we investigate two new algorithms for solving bilevel pseudomonotone variational inequality problems in real Hilbert spaces. The advantages of our algorithms are that they only need to calculate one projection on the feasible set in each iteration, and do not require the prior information of the Lipschitz constant of the cost operator. Furthermore, two new algorithms are derived to solve variational inequality problems. We establish the strong convergence of the proposed algorithms under some suitable conditions imposed on parameters. Finally, several numerical results and applications in optimal control problems are reported to illustrate the efficiency and advantages of the proposed algorithms.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Liu, L.; and Qin, X.\n\n\n \n \n \n Self adaptive inertial extragradient algorithms for solving bilevel pseudomonotone variational inequality problems.\n \n \n\n\n \n\n\n\n Japan Journal of Industrial and Applied Mathematics, 38(2): 519-543. 2021.\n \n\n(ESI Highly Cited Paper)\n\n
\n\n\n\n \n \n \"SelfPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TLQ_JIAM21,\nauthor={Tan, Bing and Liu, Liya and Qin, Xiaolong},\ntitle={Self adaptive inertial extragradient algorithms for solving bilevel pseudomonotone variational inequality problems},\njournal={Japan Journal of Industrial and Applied Mathematics},\nyear={2021},\nvolume={38},\nnumber={2},\npages={519-543},\ndoi={10.1007/s13160-020-00450-y},\nurl={https://bingtan.me/files/paper/TLQ-JIAM2021.pdf},\nabstract={We introduce two inertial extragradient algorithms for solving a bilevel pseudomonotone variational inequality problem in real Hilbert spaces. The advantages of the proposed algorithms are that they can work without the prior knowledge of the Lipschitz constant of the involving operator and only one projection onto the feasible set is required. Strong convergence theorems of the suggested algorithms are obtained under suitable conditions. Finally, some numerical examples are provided to show the efficiency of the proposed algorithms.},\nkeywords={Bilevel variational inequality problem,  Inertial method, Subgradient extragradient method,  Tseng's extragradient method,  Pseudomonotone operator,  Hybrid steepest descent method},\nabbrev_source_title={Jpn J. Ind. Appl. Math.},\nbibbase_note={<span style="color: red">(<s>ESI Highly Cited Paper</s>)</span>},\n}\n\n
\n
\n\n\n
\n We introduce two inertial extragradient algorithms for solving a bilevel pseudomonotone variational inequality problem in real Hilbert spaces. The advantages of the proposed algorithms are that they can work without the prior knowledge of the Lipschitz constant of the involving operator and only one projection onto the feasible set is required. Strong convergence theorems of the suggested algorithms are obtained under suitable conditions. Finally, some numerical examples are provided to show the efficiency of the proposed algorithms.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Fan, J.; and Qin, X.\n\n\n \n \n \n Inertial extragradient algorithms with non-monotonic step sizes for solving variational inequalities and fixed point problems.\n \n \n\n\n \n\n\n\n Advances in Operator Theory, 6(4): 61. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TFQ_AIOT21,\nauthor={Tan, Bing and Fan, Jingjing and Qin, Xiaolong},\ntitle={Inertial extragradient algorithms with non-monotonic step sizes for solving variational inequalities and fixed point problems},\njournal={Advances in Operator Theory},\nyear={2021},\nvolume={6},\nnumber={4},\ndoi={10.1007/s43036-021-00155-0},\npages={61},\nurl={https://bingtan.me/files/paper/TFQ-AIOT2021.pdf},\nabstract={In this paper, we introduce four inertial extragradient algorithms with non-monotonic step sizes to find the solution of the convex feasibility problem, which consists of a monotone variational inequality problem and a fixed point problem with a demicontractive mapping. Strong convergence theorems of the suggested algorithms are established under some standard conditions. Finally, we implement some computational tests to show the efficiency and advantages of the proposed algorithms and compare them with some existing ones.},\nkeywords={Fixed point problem,  Inertial method,  Strong convergence,  Subgradient extragradient method,  Tseng's extragradient method,  Variational inequality problem},\nabbrev_source_title={Adv. Oper. Theory},\n}\n\n
\n
\n\n\n
\n In this paper, we introduce four inertial extragradient algorithms with non-monotonic step sizes to find the solution of the convex feasibility problem, which consists of a monotone variational inequality problem and a fixed point problem with a demicontractive mapping. Strong convergence theorems of the suggested algorithms are established under some standard conditions. Finally, we implement some computational tests to show the efficiency and advantages of the proposed algorithms and compare them with some existing ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Li, S.; and Qin, X.\n\n\n \n \n \n Self-adaptive inertial single projection methods for variational inequalities involving non-Lipschitz and Lipschitz operators with their applications to optimal control problems.\n \n \n\n\n \n\n\n\n Applied Numerical Mathematics, 170: 219–241. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"Self-adaptivePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TLQ_ANM21,\nauthor={Tan, Bing and Li, Songxiao and Qin, Xiaolong},\ntitle={Self-adaptive inertial single projection methods for variational inequalities involving non-Lipschitz and Lipschitz operators with their applications to optimal control problems},\njournal={Applied Numerical Mathematics},\nyear={2021},\nvolume={170},\npages={219--241},\ndoi={10.1016/j.apnum.2021.07.022},\nurl={https://bingtan.me/files/paper/TLQ-ANM2021.pdf},\nabstract={In this paper, four accelerated subgradient extragradient methods are proposed to solve the variational inequality problem with a pseudo-monotone operator in real Hilbert spaces. These iterative schemes employ two new adaptive stepsize strategies that are significant when the Lipschitz constant of the mapping involved is unknown. Strong convergence theorems for the proposed algorithms are established under the condition that the operators are Lipschitz continuous and non-Lipschitz continuous. Numerical experiments on finite- and infinite-dimensional spaces and applications in optimal control problems are reported to demonstrate the advantages and efficiency of the proposed algorithms over some existing results.},\nkeywords={Inertial method, Subgradient extragradient method,  Optimal control problem,  Pseudomonotone operator,  Non-Lipschitz operator,  Variational inequality problem},\nabbrev_source_title={Appl Numer Math},\n}\n\n
\n
\n\n\n
\n In this paper, four accelerated subgradient extragradient methods are proposed to solve the variational inequality problem with a pseudo-monotone operator in real Hilbert spaces. These iterative schemes employ two new adaptive stepsize strategies that are significant when the Lipschitz constant of the mapping involved is unknown. Strong convergence theorems for the proposed algorithms are established under the condition that the operators are Lipschitz continuous and non-Lipschitz continuous. Numerical experiments on finite- and infinite-dimensional spaces and applications in optimal control problems are reported to demonstrate the advantages and efficiency of the proposed algorithms over some existing results.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Li, S.; and Qin, X.\n\n\n \n \n \n An accelerated extragradient algorithm for bilevel pseudomonotone variational inequality problems with application to optimal control problems.\n \n \n\n\n \n\n\n\n Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas, 115(4): 174. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TLQ_RCSM21,\nauthor={Tan, Bing and Li, Songxiao and Qin, Xiaolong},\ntitle={An accelerated extragradient algorithm for bilevel pseudomonotone variational inequality problems with application to optimal control problems},\njournal={Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas},\nyear={2021},\nvolume={115},\nnumber={4},\ndoi={10.1007/s13398-021-01116-1},\npages={174},\nurl={https://bingtan.me/files/paper/TLQ-RACSAM2021.pdf},\nabstract={In this paper, an inertial extragradient algorithm with a new non-monotonic stepsize is proposed to solve the bilevel pseudomonotone variational inequality problem in real Hilbert spaces. The advantages of the suggested iterative algorithm are that only one projection onto the feasible set needs to be performed in each iteration and the prior knowledge of the Lipschitz constant of the mapping involved does not require to be known. The strong convergence theorem of the suggested algorithm is established under some suitable conditions. Numerical experiments are reported to illustrate the advantages and efficiency of the presented algorithm over the existing related ones.},\nkeywords={Bilevel variational inequality problem,  Hybrid steepest descent method,  Inertial extragradient method,  Projection and contraction method,  Pseudomonotone operator},\nabbrev_source_title={Rev. R. Acad. Cienc. Exactas F{\\' i}s. Nat. Ser. A Mat. RACSAM},\n}\n\n
\n
\n\n\n
\n In this paper, an inertial extragradient algorithm with a new non-monotonic stepsize is proposed to solve the bilevel pseudomonotone variational inequality problem in real Hilbert spaces. The advantages of the suggested iterative algorithm are that only one projection onto the feasible set needs to be performed in each iteration and the prior knowledge of the Lipschitz constant of the mapping involved does not require to be known. The strong convergence theorem of the suggested algorithm is established under some suitable conditions. Numerical experiments are reported to illustrate the advantages and efficiency of the presented algorithm over the existing related ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Li, S.; and Qin, X.\n\n\n \n \n \n On modified subgradient extragradient methods for pseudomonotone variational inequality problems with applications.\n \n \n\n\n \n\n\n\n Computational and Applied Mathematics, 40(7): 253. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TLQ_COAM21,\nauthor={Tan, Bing and Li, Songxiao and Qin, Xiaolong},\ntitle={On modified subgradient extragradient methods for pseudomonotone variational inequality problems with applications},\njournal={Computational and Applied Mathematics},\nyear={2021},\nvolume={40},\nnumber={7},\ndoi={10.1007/s40314-021-01642-z},\npages={253},\nurl={https://bingtan.me/files/paper/TLQ-COAM2021.pdf},\nabstract={This paper presents several modified subgradient extragradient methods with inertial effects to approximate solutions of variational inequality problems in real Hilbert spaces. The operators involved are either pseudomonotone Lipschitz continuous or pseudomonotone non-Lipschitz continuous. The advantage of the suggested algorithms is that they can work adaptively without the prior information of the Lipschitz constant of the mapping involved. Strong convergence theorems of the proposed algorithms are established under some suitable conditions. Finally, some numerical experiments are given to verify the advantages and efficiency of the proposed iterative algorithms with respect to previously known ones.},\nkeywords={Extragradient method,  Non-Lipschitz operator,  Optimal control problem,  Pseudomonotone operator,  Variational inequality problem},\nabbrev_source_title={Comput. Appl. Math.},\n}\n\n
\n
\n\n\n
\n This paper presents several modified subgradient extragradient methods with inertial effects to approximate solutions of variational inequality problems in real Hilbert spaces. The operators involved are either pseudomonotone Lipschitz continuous or pseudomonotone non-Lipschitz continuous. The advantage of the suggested algorithms is that they can work adaptively without the prior information of the Lipschitz constant of the mapping involved. Strong convergence theorems of the proposed algorithms are established under some suitable conditions. Finally, some numerical experiments are given to verify the advantages and efficiency of the proposed iterative algorithms with respect to previously known ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Fan, J.; and Li, S.\n\n\n \n \n \n Self-adaptive inertial extragradient algorithms for solving variational inequality problems.\n \n \n\n\n \n\n\n\n Computational and Applied Mathematics, 40(1): 19. 2021.\n \n\n(ESI Highly Cited Paper)\n\n
\n\n\n\n \n \n \"Self-adaptivePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TFL_COAM21,\nauthor={Tan, Bing and Fan, Jingjing and Li, Songxiao},\ntitle={Self-adaptive inertial extragradient algorithms for solving variational inequality problems},\njournal={Computational and Applied Mathematics},\nyear={2021},\nvolume={40},\nnumber={1},\ndoi={10.1007/s40314-020-01393-3},\npages={19},\nurl={https://bingtan.me/files/paper/TFL-COAM2021.pdf},\nabstract={In this paper, we study the strong convergence of two Mann-type inertial extragradient algorithms, which are devised with a new step size, for solving a variational inequality problem with a monotone and Lipschitz continuous operator in real Hilbert spaces. Strong convergence theorems for the suggested algorithms are proved without the prior knowledge of the Lipschitz constant of the operator. Finally, we provide some numerical experiments to illustrate the performance of the proposed algorithms and provide a comparison with related ones.},\nkeywords={Inertial method,  Mann method,  Subgradient extragradient method,  Tseng's extragradient method,  Variational inequality problem},\nabbrev_source_title={Comput. Appl. Math.},\nbibbase_note={<span style="color: red">(<s>ESI Highly Cited Paper</s>)</span>},\n}\n\n
\n
\n\n\n
\n In this paper, we study the strong convergence of two Mann-type inertial extragradient algorithms, which are devised with a new step size, for solving a variational inequality problem with a monotone and Lipschitz continuous operator in real Hilbert spaces. Strong convergence theorems for the suggested algorithms are proved without the prior knowledge of the Lipschitz constant of the operator. Finally, we provide some numerical experiments to illustrate the performance of the proposed algorithms and provide a comparison with related ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Cho, S. Y.\n\n\n \n \n \n Self-adaptive inertial shrinking projection algorithms for solving pseudomonotone variational inequalities.\n \n \n\n\n \n\n\n\n Journal of Nonlinear and Convex Analysis, 22(3): 613–627. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"Self-adaptivePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TC_JNCA21,\nauthor={Tan, Bing and Cho, Sun Y.},\ntitle={Self-adaptive inertial shrinking projection algorithms for solving pseudomonotone variational inequalities},\njournal={Journal of Nonlinear and Convex Analysis},\nyear={2021},\nvolume={22},\nnumber={3},\npages={613--627},\nurl={https://bingtan.me/files/paper/TC-JNCA2021.pdf},\nabstract={In this paper, we construct two fast iterative methods to solve pseudomonotone variational inequalities in real Hilbert spaces. The advantage of the suggested iterative schemes is that they can adaptively update the iterative step size through some previously known information without performing any line search process. Strong convergence theorems of the proposed algorithms are established under some relaxed conditions imposed on the parameters. Finally, several numerical tests are given to show the advantages and efficiency of the proposed approaches compared with the existing results.},\nkeywords={Inertial method, Subgradient extragradient method,  Tseng's extragradient method,  Pseudomonotone operator,  Shrinking projection method,  Variational inequality problem},\nabbrev_source_title={J. Nonlinear Convex Anal.},\n}\n\n
\n
\n\n\n
\n In this paper, we construct two fast iterative methods to solve pseudomonotone variational inequalities in real Hilbert spaces. The advantage of the suggested iterative schemes is that they can adaptively update the iterative step size through some previously known information without performing any line search process. Strong convergence theorems of the proposed algorithms are established under some relaxed conditions imposed on the parameters. Finally, several numerical tests are given to show the advantages and efficiency of the proposed approaches compared with the existing results.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Cho, S. Y.\n\n\n \n \n \n Inertial extragradient methods for solving pseudomonotone variational inequalities with non-lipschitz mappings and their optimization applications.\n \n \n\n\n \n\n\n\n Applied Set-Valued Analysis and Optimization, 3(2): 165–192. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TC_ASVAO21,\nauthor={Tan, Bing and Cho, Sun Y.},\ntitle={Inertial extragradient methods for solving pseudomonotone variational inequalities with non-lipschitz mappings and their optimization applications},\njournal={Applied Set-Valued Analysis and Optimization},\nyear={2021},\nvolume={3},\nnumber={2},\npages={165--192},\ndoi={10.23952/asvao.3.2021.2.03},\nurl={https://bingtan.me/files/paper/TC-ASVAO2021.pdf},\nabstract={In this paper, four extragradient-type algorithms with inertial terms are presented for solving the variational inequality problem with a pseudomonotone and non-Lipschitz continuous operator in real Hilbert spaces. Strong convergence theorems of the suggested methods are established under some suitable conditions imposed on the parameters. Finally, several computational tests and applications in optimal control problems are given to illustrate the efficiency and advantages of the proposed iterative schemes over some known ones.},\nkeywords={Inertial extragradient method,  Non-Lipschitz operator,  Pseudomonotone operator,  Variational inequality problem,  Viscosity method},\nabbrev_source_title={Appl. Set-Valued. Anal. Optim.},\n}\n\n
\n
\n\n\n
\n In this paper, four extragradient-type algorithms with inertial terms are presented for solving the variational inequality problem with a pseudomonotone and non-Lipschitz continuous operator in real Hilbert spaces. Strong convergence theorems of the suggested methods are established under some suitable conditions imposed on the parameters. Finally, several computational tests and applications in optimal control problems are given to illustrate the efficiency and advantages of the proposed iterative schemes over some known ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Liu, L.; Tan, B.; and Latif, A.\n\n\n \n \n \n Approximation of fixed points for a semigroup of Bregman quasi-nonexpansive mappings in Banach spaces.\n \n \n\n\n \n\n\n\n Journal of Nonlinear and Variational Analysis, 5(1): 9–22. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"ApproximationPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{LTL_JNVA21,\nauthor={Liu, Liya and Tan, Bing and Latif, A.},\ntitle={Approximation of fixed points for a semigroup of Bregman quasi-nonexpansive mappings in {B}anach spaces},\njournal={Journal of Nonlinear and Variational Analysis},\nyear={2021},\nvolume={5},\nnumber={1},\npages={9--22},\ndoi={10.23952/jnva.5.2021.1.02},\nurl={https://bingtan.me/files/paper/LTL-JNVA2021.pdf},\nabstract={The purpose of this paper is to study the iterative scheme of the Halpern type for a commutative semigroup $\\mathfrak{J}=\\left\\{S_{\\lambda}: \\lambda \\in \\mathcal{Q}\\right\\}$ of Bregman quasi-nonexpansive mappings on a closed and convex subset of a Banach space. A strong convergence theorem is established for finding a common fixed point solution. Our results extend and improve some related results in the current literature. In addition, we present numerical examples to illustrate the performance of our method in finite and infinite dimensional spaces.},\nkeywords={Banach space,  Bregman quasi-nonexpansive,  Fixed point problem,  Halpern method,  Strong convergence},\nabbrev_source_title={J. Nonlinear Var. Anal.},\n}\n\n
\n
\n\n\n
\n The purpose of this paper is to study the iterative scheme of the Halpern type for a commutative semigroup $\\mathfrak{J}=łeft\\{S_{λ}: λ ∈ \\mathcal{Q}i̊ght\\}$ of Bregman quasi-nonexpansive mappings on a closed and convex subset of a Banach space. A strong convergence theorem is established for finding a common fixed point solution. Our results extend and improve some related results in the current literature. In addition, we present numerical examples to illustrate the performance of our method in finite and infinite dimensional spaces.\n
\n\n\n
\n\n\n
\n \n\n \n \n Zhou, Z.; Tan, B.; and Li, S.\n\n\n \n \n \n An accelerated hybrid projection method with a self-adaptive step-size sequence for solving split common fixed point problems.\n \n \n\n\n \n\n\n\n Mathematical Methods in the Applied Sciences, 44(8): 7294–7303. 2021.\n \n\n(ESI Highly Cited Paper)\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{ZTL_MMAS21,\nauthor={Zhou, Zheng and Tan, Bing and Li, Songxiao},\ntitle={An accelerated hybrid projection method with a self-adaptive step-size sequence for solving split common fixed point problems},\njournal={Mathematical Methods in the Applied Sciences},\nyear={2021},\nvolume={44},\nnumber={8},\npages={7294--7303},\ndoi={10.1002/mma.7261},\nurl={https://bingtan.me/files/paper/ZTL-MMAS2021.pdf},\nabstract={This paper attempts to solve the split common fixed point problem for demicontractive mappings. We give an accelerated hybrid projection algorithm that combines the hybrid projection method and the inertial technique. The strong convergence theorem of this algorithm is obtained under mild conditions by a self-adaptive step-size sequence, which does not need prior knowledge of the operator norm. Some numerical experiments in infinite-dimensional Hilbert spaces are provided to illustrate the reliability and robustness of the algorithm and also to compare it with existing ones.},\nkeywords={Demicontractive mapping,  Hybrid projection method,  Inertial method,  Split common fixed point problem},\nabbrev_source_title={Math. Methods Appl. Sci.},\nbibbase_note={<span style="color: red">(<s>ESI Highly Cited Paper</s>)</span>},\n}\n\n
\n
\n\n\n
\n This paper attempts to solve the split common fixed point problem for demicontractive mappings. We give an accelerated hybrid projection algorithm that combines the hybrid projection method and the inertial technique. The strong convergence theorem of this algorithm is obtained under mild conditions by a self-adaptive step-size sequence, which does not need prior knowledge of the operator norm. Some numerical experiments in infinite-dimensional Hilbert spaces are provided to illustrate the reliability and robustness of the algorithm and also to compare it with existing ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Fan, J.; Tan, B.; and Li, S.\n\n\n \n \n \n An explicit extragradient algorithm for equilibrium problems on HHadamard manifolds.\n \n \n\n\n \n\n\n\n Computational and Applied Mathematics, 40(2): 68. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{FTL_COAM21,\nauthor={Fan, Jingjing and Tan, Bing and Li, Songxiao},\ntitle={An explicit extragradient algorithm for equilibrium problems on {H}{H}adamard manifolds},\njournal={Computational and Applied Mathematics},\nyear={2021},\nvolume={40},\nnumber={2},\ndoi={10.1007/s40314-021-01427-4},\npages={68},\nurl={https://bingtan.me/files/paper/FTL-COAM2021.pdf},\nabstract={In this paper, we investigate a new extragradient algorithm for solving pseudomonotone equilibrium problems on Hadamard manifolds. Our algorithm uses a variable stepsize, which is updated at each iteration and based on some previous iterates. The convergence analysis of the proposed algorithm is discussed under mild assumptions. In the case where the equilibrium bifunction is strongly pseudomonotone, the R-linear rate of convergence of the new algorithm is formulated. A fundamental experiment is provided to illustrate the numerical behavior of the algorithm.},\nkeywords={Equilibrium problem,  Extragradient method,  Hadamard manifolds,  Lipschitz-type bifunction,  Pseudomonotone bifunction},\nabbrev_source_title={Comput. Appl. Math.},\n}\n\n
\n
\n\n\n
\n In this paper, we investigate a new extragradient algorithm for solving pseudomonotone equilibrium problems on Hadamard manifolds. Our algorithm uses a variable stepsize, which is updated at each iteration and based on some previous iterates. The convergence analysis of the proposed algorithm is discussed under mild assumptions. In the case where the equilibrium bifunction is strongly pseudomonotone, the R-linear rate of convergence of the new algorithm is formulated. A fundamental experiment is provided to illustrate the numerical behavior of the algorithm.\n
\n\n\n
\n\n\n
\n \n\n \n \n Fan, J.; Qin, X.; and Tan, B.\n\n\n \n \n \n Convergence of an inertial shadow Douglas-Rachford splitting algorithm for monotone inclusions.\n \n \n\n\n \n\n\n\n Numerical Functional Analysis and Optimization, 42(14): 1627–1644. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"ConvergencePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{FQT_NFAO21,\nauthor={Fan, Jingjing and Qin, Xiaolong and Tan, Bing},\ntitle={Convergence of an inertial shadow {D}ouglas-{R}achford splitting algorithm for monotone inclusions},\njournal={Numerical Functional Analysis and Optimization},\nyear={2021},\nvolume={42},\nnumber={14},\npages={1627--1644},\ndoi={10.1080/01630563.2021.2001749},\nurl={https://bingtan.me/files/paper/FQT-NFAO2021.pdf},\nabstract={An inertial shadow Douglas-Rachford splitting algorithm for finding zeros of the sum of monotone operators is proposed in Hilbert spaces. Moreover, a three-operator splitting algorithm for solving a class of monotone inclusion problems is also concerned. The weak convergence of the algorithms is investigated under mild assumptions. Some numerical experiments are implemented to illustrate our main convergence results.},\nkeywords={Inertial method,  Monotone inclusion,  Shadow Douglas-Rachford splitting algorithm,  Three-operator splitting},\nabbrev_source_title={Numer. Funct. Anal. Optim.},\n}\n\n
\n
\n\n\n
\n An inertial shadow Douglas-Rachford splitting algorithm for finding zeros of the sum of monotone operators is proposed in Hilbert spaces. Moreover, a three-operator splitting algorithm for solving a class of monotone inclusion problems is also concerned. The weak convergence of the algorithms is investigated under mild assumptions. Some numerical experiments are implemented to illustrate our main convergence results.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Li, S.\n\n\n \n \n \n Strong convergence of inertial mann algorithms for solving hierarchical fixed point problems.\n \n \n\n\n \n\n\n\n Journal of Nonlinear and Variational Analysis, 4(3): 337–355. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"StrongPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TL_JNVA20,\nauthor={Tan, Bing and Li, Songxiao},\ntitle={Strong convergence of inertial mann algorithms for solving hierarchical fixed point problems},\njournal={Journal of Nonlinear and Variational Analysis},\nyear={2020},\nvolume={4},\nnumber={3},\npages={337--355},\ndoi={10.23952/jnva.4.2020.3.02},\nurl={https://bingtan.me/files/paper/TL-JNVA2020.pdf},\nabstract={The paper introduces two inertial Mann algorithms to find solutions of hierarchical fixed point problems of nonexpansive mappings. We obtain strong convergence theorems in Hilbert spaces under suitable conditions. Some numerical examples are provided to illustrate the numerical behavior of the algorithms and numerical results show that our proposed algorithms are efficient and robust.},\nkeywords={Hierarchical fixed point problem,  Inertial method, Mann method,  Nonexpansive mapping,  Strong convergence,  Viscosity method},\nabbrev_source_title={J. Nonlinear Var. Anal.},\n}\n\n
\n
\n\n\n
\n The paper introduces two inertial Mann algorithms to find solutions of hierarchical fixed point problems of nonexpansive mappings. We obtain strong convergence theorems in Hilbert spaces under suitable conditions. Some numerical examples are provided to illustrate the numerical behavior of the algorithms and numerical results show that our proposed algorithms are efficient and robust.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Cho, S. Y.\n\n\n \n \n \n An inertial mann-like algorithm for fixed points of nonexpansive mappings in Hilbert spaces.\n \n \n\n\n \n\n\n\n Journal of Applied and Numerical Optimization, 2(3): 335–351. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TC_JANO20,\nauthor={Tan, Bing and Cho, Sun Y.},\ntitle={An inertial mann-like algorithm for fixed points of nonexpansive mappings in {H}ilbert spaces},\njournal={Journal of Applied and Numerical Optimization},\nyear={2020},\nvolume={2},\nnumber={3},\npages={335--351},\ndoi={10.23952/jano.2.2020.3.05},\nurl={https://bingtan.me/files/paper/TC-JANO2020.pdf},\nabstract={In this paper, we investigate an inertial Mann-like algorithm for fixed points of nonexpansive mappings in Hilbert spaces and obtain strong convergence results under some mild assumptions. Based on this, we derive a forward-backward algorithm involving Tikhonov regularization terms, which converges strongly to the solution of the monotone inclusion problem. We demonstrate the advantages of our algorithms comparing with some existing ones in the literature via split feasibility problem, variational inequality problem and signal recovery problem.},\nkeywords={Forward-backward splitting algorithm,  Inertial method, Mann method,  Nonexpansive mapping,  Strong convergence,  Tikhonov regularization},\nabbrev_source_title={J. Appl. Numer. Optim.},\n}\n\n
\n
\n\n\n
\n In this paper, we investigate an inertial Mann-like algorithm for fixed points of nonexpansive mappings in Hilbert spaces and obtain strong convergence results under some mild assumptions. Based on this, we derive a forward-backward algorithm involving Tikhonov regularization terms, which converges strongly to the solution of the monotone inclusion problem. We demonstrate the advantages of our algorithms comparing with some existing ones in the literature via split feasibility problem, variational inequality problem and signal recovery problem.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; and Xu, S.\n\n\n \n \n \n Strong convergence of two inertial projection algorithms in Hilbert spaces.\n \n \n\n\n \n\n\n\n Journal of Applied and Numerical Optimization, 2(2): 171–186. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"StrongPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TX_JANO20,\nauthor={Tan, Bing and Xu, Shanshan},\ntitle={Strong convergence of two inertial projection algorithms in {H}ilbert spaces},\njournal={Journal of Applied and Numerical Optimization},\nyear={2020},\nvolume={2},\nnumber={2},\npages={171--186},\ndoi={10.23952/jano.2.2020.2.04},\nurl={https://bingtan.me/files/paper/TX-JANO2020.pdf},\nabstract={In this paper, we propose two inertial projection algorithms for finding a common solution of monotone variational inclusions and hierarchical fixed point problems of nonexpansive mappings. We obtain two strong convergence theorems under some suitable conditions in Hilbert spaces. In addition, we also give numerical examples to compare our algorithms with the existing ones. Numerical results show that our proposed algorithms are efficient and robust.},\nkeywords={Hierarchical fixed point problem,  Inertial method,  Monotone operator,  Strong convergence,  Inclusion problem},\nabbrev_source_title={J. Appl. Numer. Optim.},\n}\n\n
\n
\n\n\n
\n In this paper, we propose two inertial projection algorithms for finding a common solution of monotone variational inclusions and hierarchical fixed point problems of nonexpansive mappings. We obtain two strong convergence theorems under some suitable conditions in Hilbert spaces. In addition, we also give numerical examples to compare our algorithms with the existing ones. Numerical results show that our proposed algorithms are efficient and robust.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Zhou, Z.; and Qin, X.\n\n\n \n \n \n Accelerated projection-based forward-backward splitting algorithms for monotone inclusion problems.\n \n \n\n\n \n\n\n\n Journal of Applied Analysis and Computation, 10(5): 2184–2197. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"AcceleratedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TZQ_JAAC20,\nauthor={Tan, Bing and Zhou, Zheng and Qin, Xiaolong},\ntitle={Accelerated projection-based forward-backward splitting algorithms for monotone inclusion problems},\njournal={Journal of Applied Analysis and Computation},\nyear={2020},\nvolume={10},\nnumber={5},\npages={2184--2197},\ndoi={10.11948/20190363},\nurl={https://bingtan.me/files/paper/TZQ-JAAC2020.pdf},\nabstract={In this paper, based on inertial and Tseng's ideas, we propose two projection-based algorithms to solve a monotone inclusion problem in infinite dimensional Hilbert spaces. Solution theorems of strong convergence are obtained under the certain conditions. Some numerical experiments are presented to illustrate that our algorithms are efficient than the existing results.},\nkeywords={Forward-backward splitting algorithm,  Inclusion problem,  Monotone operator,  Strong convergence},\nabbrev_source_title={J. Appl. Anal. Comput.},\n}\n\n
\n
\n\n\n
\n In this paper, based on inertial and Tseng's ideas, we propose two projection-based algorithms to solve a monotone inclusion problem in infinite dimensional Hilbert spaces. Solution theorems of strong convergence are obtained under the certain conditions. Some numerical experiments are presented to illustrate that our algorithms are efficient than the existing results.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Xu, S.; and Li, S.\n\n\n \n \n \n Inertial shrinking projection algorithms for solving hierarchical variational inequality problems.\n \n \n\n\n \n\n\n\n Journal of Nonlinear and Convex Analysis, 21(4): 871–884. 2020.\n \n\n(ESI Highly Cited Paper)\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TXL_JNCA20_2,\nauthor={Tan, Bing and Xu, Shanshan and Li, Songxiao},\ntitle={Inertial shrinking projection algorithms for solving hierarchical variational inequality problems},\njournal={Journal of Nonlinear and Convex Analysis},\nyear={2020},\nvolume={21},\nnumber={4},\npages={871--884},\nurl={https://bingtan.me/files/paper/TXL-JNCA2020.pdf},\nabstract={In this paper, we propose two inertial shrinking algorithms to approximate a solution of hierarchical variational inequality problems with nonex-pansive mappings in Hilbert spaces. We prove strong convergence theorems under some mild conditions. Finally, we present some numerical examples to compare our algorithms with some existing algorithms, which illustrate the advantage of our proposed algorithms.},\nkeywords={Hierarchical variational inequality problem,  Inertial method, Mann method,  Nonexpansive mapping,  Shrinking projection method,  Strong convergence},\nabbrev_source_title={J. Nonlinear Convex Anal.},\nbibbase_note={<span style="color: red">(<s>ESI Highly Cited Paper</s>)</span>},\n}\n\n
\n
\n\n\n
\n In this paper, we propose two inertial shrinking algorithms to approximate a solution of hierarchical variational inequality problems with nonex-pansive mappings in Hilbert spaces. We prove strong convergence theorems under some mild conditions. Finally, we present some numerical examples to compare our algorithms with some existing algorithms, which illustrate the advantage of our proposed algorithms.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Xu, S.; and Li, S.\n\n\n \n \n \n Inertial hybrid and shrinking projection algorithms for solving variational inequality problems.\n \n \n\n\n \n\n\n\n Journal of Nonlinear and Convex Analysis, 21(10): 2193–2206. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TXL_JNCA20_1,\nauthor={Tan, Bing and Xu, Shanshan and Li, Songxiao},\ntitle={Inertial hybrid and shrinking projection algorithms for solving variational inequality problems},\njournal={Journal of Nonlinear and Convex Analysis},\nyear={2020},\nvolume={21},\nnumber={10},\npages={2193--2206},\nurl={https://bingtan.me/files/paper/TXL-JNCA2020-10.pdf},\nabstract={In this paper, we propose two inertial hybrid and shrinking projection algorithms for strict pseudo-contractions in Hilbert spaces and obtain strong theorems in general conditions. In addition, we also propose two new inertial hybrid and shrinking projection algorithms without extrapolating step for non-expansive mappings in Hilbert spaces and get strong convergence results. Finally, we give some numerical examples to illustrate the computational performance of our proposed algorithms.},\nkeywords={Variational inequality problem,  Inertial method, Hybrid projection method, Shrinking projection method, Strong convergence},\nabbrev_source_title={J. Nonlinear Convex Anal.},\n}\n\n
\n
\n\n\n
\n In this paper, we propose two inertial hybrid and shrinking projection algorithms for strict pseudo-contractions in Hilbert spaces and obtain strong theorems in general conditions. In addition, we also propose two new inertial hybrid and shrinking projection algorithms without extrapolating step for non-expansive mappings in Hilbert spaces and get strong convergence results. Finally, we give some numerical examples to illustrate the computational performance of our proposed algorithms.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Xu, S.; and Li, S.\n\n\n \n \n \n Modified inertial hybrid and shrinking projection algorithms for solving fixed point problems.\n \n \n\n\n \n\n\n\n Mathematics, 8(2): 236. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"ModifiedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TXL_MATH20,\nauthor={Tan, Bing and Xu, Shanshan and Li, Songxiao},\ntitle={Modified inertial hybrid and shrinking projection algorithms for solving fixed point problems},\njournal={Mathematics},\nyear={2020},\nvolume={8},\nnumber={2},\ndoi={10.3390/math8020236},\npages={236},\nurl={https://bingtan.me/files/paper/TXL-Math2020.pdf},\nabstract={In this paper, we introduce two modified inertial hybrid and shrinking projection algorithms for solving fixed point problems by combining the modified inertial Mann algorithm with the projection algorithm. We establish strong convergence theorems under certain suitable conditions. Finally, our algorithms are applied to convex feasibility problem, variational inequality problem, and location theory. The algorithms and results presented in this paper can summarize and unify corresponding results previously known in this field.},\nkeywords={Conjugate gradient method,  Hybrid projection method,  Inertial method,  Nonexpansive mapping,  Shrinking projection method,  Hybrid steepest descent method,  Strong convergence},\nabbrev_source_title={Mathematics},\n}\n\n
\n
\n\n\n
\n In this paper, we introduce two modified inertial hybrid and shrinking projection algorithms for solving fixed point problems by combining the modified inertial Mann algorithm with the projection algorithm. We establish strong convergence theorems under certain suitable conditions. Finally, our algorithms are applied to convex feasibility problem, variational inequality problem, and location theory. The algorithms and results presented in this paper can summarize and unify corresponding results previously known in this field.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Zhou, Z.; and Li, S.\n\n\n \n \n \n Strong convergence of modified inertial mann algorithms for nonexpansive mappings.\n \n \n\n\n \n\n\n\n Mathematics, 8(4): 462. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"StrongPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TZL_MATH20,\nauthor={Tan, Bing and Zhou, Zheng and Li, Songxiao},\ntitle={Strong convergence of modified inertial mann algorithms for nonexpansive mappings},\njournal={Mathematics},\nyear={2020},\nvolume={8},\nnumber={4},\ndoi={10.3390/math8040462},\npages={462},\nurl={https://bingtan.me/files/paper/TZL-Math2020.pdf},\nabstract={We investigated two new modified inertial Mann Halpern and inertial Mann viscosity algorithms for solving fixed point problems. Strong convergence theorems under some fewer restricted conditions are established in the framework of infinite dimensional Hilbert spaces. Finally, some numerical examples are provided to support our main results. The algorithms and results presented in this paper can generalize and extend corresponding results previously known in the literature.},\nkeywords={Halpern method,  Inertial method,  Nonexpansive mapping,  Strong convergence,  Viscosity method},\nabbrev_source_title={Mathematics},\n}\n\n
\n
\n\n\n
\n We investigated two new modified inertial Mann Halpern and inertial Mann viscosity algorithms for solving fixed point problems. Strong convergence theorems under some fewer restricted conditions are established in the framework of infinite dimensional Hilbert spaces. Finally, some numerical examples are provided to support our main results. The algorithms and results presented in this paper can generalize and extend corresponding results previously known in the literature.\n
\n\n\n
\n\n\n
\n \n\n \n \n Liu, L.; Tan, B.; and Cho, S. Y.\n\n\n \n \n \n On the resolution of variational inequality problems with a double-hierarchical structure.\n \n \n\n\n \n\n\n\n Journal of Nonlinear and Convex Analysis, 21(2): 377–386. 2020.\n \n\n(ESI Highly Cited Paper)\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{LTC_JNCA20,\nauthor={Liu, Liya and Tan, Bing and Cho, Sun Y.},\ntitle={On the resolution of variational inequality problems with a double-hierarchical structure},\njournal={Journal of Nonlinear and Convex Analysis},\nyear={2020},\nvolume={21},\nnumber={2},\npages={377--386},\nurl={https://bingtan.me/files/paper/LTC-JNCA2020.pdf},\nabstract={In this paper, we discuss a pseudo-monotone variational inequality problem with a variational inequality constraint over a general, nonempty, closed and convex set, which is called the double-hierarchical constrained optimization problem. In addition, we propose an iterative algorithm by incorporating inertial terms in the extragradient algorithm. Strong convergence of the algorithm to the unique solution of the problem is guaranteed under certain assumptions.},\nkeywords={Constrained optimization problem,  Inertial method, Pseudomonotone operator,  Variational inequality problem},\nabbrev_source_title={J. Nonlinear Convex Anal.},\nbibbase_note={<span style="color: red">(ESI Highly Cited Paper)</span>},\n}\n\n
\n
\n\n\n
\n In this paper, we discuss a pseudo-monotone variational inequality problem with a variational inequality constraint over a general, nonempty, closed and convex set, which is called the double-hierarchical constrained optimization problem. In addition, we propose an iterative algorithm by incorporating inertial terms in the extragradient algorithm. Strong convergence of the algorithm to the unique solution of the problem is guaranteed under certain assumptions.\n
\n\n\n
\n\n\n
\n \n\n \n \n Zhou, Z.; Tan, B.; and Li, S.\n\n\n \n \n \n A new accelerated self-adaptive stepsize algorithm with excellent stability for split common fixed point problems.\n \n \n\n\n \n\n\n\n Computational and Applied Mathematics, 39(3): 220. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{ZTL_COAM20,\nauthor={Zhou, Zheng and Tan, Bing and Li, Songxiao},\ntitle={A new accelerated self-adaptive stepsize algorithm with excellent stability for split common fixed point problems},\njournal={Computational and Applied Mathematics},\nyear={2020},\nvolume={39},\nnumber={3},\ndoi={10.1007/s40314-020-01237-0},\npages={220},\nurl={https://bingtan.me/files/paper/ZTL-COAM2020.pdf},\nabstract={In the framework of Hilbert spaces, we study the solutions of split common fixed point problems. A new accelerated self-adaptive stepsize algorithm with excellent stability is proposed under the effects of inertial techniques and Meir–Keeler contraction mappings. The strong convergence theorems are obtained without prior knowledge of operator norms. Finally, in applications, our main results in this paper are applied to signal recovery problems.},\nkeywords={Inertial method,  Meir–Keeler contraction,  Adaptive stepsize,  Signal processing problem, Split common fixed point problem},\nabbrev_source_title={Comput. Appl. Math.},\n}\n\n
\n
\n\n\n
\n In the framework of Hilbert spaces, we study the solutions of split common fixed point problems. A new accelerated self-adaptive stepsize algorithm with excellent stability is proposed under the effects of inertial techniques and Meir–Keeler contraction mappings. The strong convergence theorems are obtained without prior knowledge of operator norms. Finally, in applications, our main results in this paper are applied to signal recovery problems.\n
\n\n\n
\n\n\n
\n \n\n \n \n Zhou, Z.; Tan, B.; and Li, S.\n\n\n \n \n \n An inertial shrinking projection algorithm for split common fixed point problems.\n \n \n\n\n \n\n\n\n Journal of Applied Analysis and Computation, 10(5): 2104–2120. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{ZTL_JAAC20,\nauthor={Zhou, Zheng and Tan, Bing and Li, Songxiao},\ntitle={An inertial shrinking projection algorithm for split common fixed point problems},\njournal={Journal of Applied Analysis and Computation},\nyear={2020},\nvolume={10},\nnumber={5},\npages={2104--2120},\ndoi={10.11948/20190330},\nurl={https://bingtan.me/files/paper/ZTL-JAAC2020.pdf},\nabstract={In this paper, the purpose is to introduce and study a new modified shrinking projection algorithm with inertial effects, which solves split common fixed point problems in Banach spaces. The corresponding strong convergence theorems are obtained without the assumption of semi-compactness on map-pings. Finally, some numerical examples are presented to illustrate the results in this paper.},\nkeywords={Inertial method,  Shrinking projection method,  Split common fixed point problem,  Strong convergence},\nabbrev_source_title={J. Appl. Anal. Comput.},\n}\n\n
\n
\n\n\n
\n In this paper, the purpose is to introduce and study a new modified shrinking projection algorithm with inertial effects, which solves split common fixed point problems in Banach spaces. The corresponding strong convergence theorems are obtained without the assumption of semi-compactness on map-pings. Finally, some numerical examples are presented to illustrate the results in this paper.\n
\n\n\n
\n\n\n
\n \n\n \n \n Luo, Y.; Shang, M.; and Tan, B.\n\n\n \n \n \n A general inertial viscosity type method for nonexpansive mappings and its applications in signal processing.\n \n \n\n\n \n\n\n\n Mathematics, 8(2): 288. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{LST_MATH20,\nauthor={Luo, Yinglin and Shang, Meijuan and Tan, Bing},\ntitle={A general inertial viscosity type method for nonexpansive mappings and its applications in signal processing},\njournal={Mathematics},\nyear={2020},\nvolume={8},\nnumber={2},\ndoi={10.3390/math8020288},\npages={288},\nurl={https://bingtan.me/files/paper/LST-Math2020.pdf},\nabstract={In this paper, we propose viscosity algorithms with two different inertia parameters for solving fixed points of nonexpansive and strictly pseudocontractive mappings. Strong convergence theorems are obtained in Hilbert spaces and the applications to the signal processing are considered. Moreover, some numerical experiments of proposed algorithms and comparisons with existing algorithms are given to the demonstration of the efficiency of the proposed algorithms. The numerical results show that our algorithms are superior to some related algorithms.},\nkeywords={Inclusion problem,  Nonexpansive mapping,  Signal processing problem,  Strict pseudo-contraction,  Variational inequality problem},\nabbrev_source_title={Mathematics},\n}\n\n\n\n\n\n\n\n\n\n
\n
\n\n\n
\n In this paper, we propose viscosity algorithms with two different inertia parameters for solving fixed points of nonexpansive and strictly pseudocontractive mappings. Strong convergence theorems are obtained in Hilbert spaces and the applications to the signal processing are considered. Moreover, some numerical experiments of proposed algorithms and comparisons with existing algorithms are given to the demonstration of the efficiency of the proposed algorithms. The numerical results show that our algorithms are superior to some related algorithms.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n Wang, F.\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Hu, S.; Wang, Y.; Tan, B.; and Wang, F.\n\n\n \n \n \n Inertial iterative method for solving variational inequality problems of pseudo-monotone operators and fixed point problems of nonexpansive mappings in Hilbert spaces.\n \n \n\n\n \n\n\n\n Journal of Industrial and Management Optimization, 19(4): 2655–2675. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{HWTW_JIMO23,\nauthor={Hu, Shaotao and Wang, Yuanheng and Tan, Bing and Wang, Fenghui},\ntitle={Inertial iterative method for solving variational inequality problems of pseudo-monotone operators and fixed point problems of nonexpansive mappings in {H}ilbert spaces},\njournal={Journal of Industrial and Management Optimization},\nyear={2023},\nvolume={19},\nnumber={4},\npages={2655--2675},\ndoi={10.3934/jimo.2022060},\nurl={https://bingtan.me/files/paper/HWTW-JIMO2023.pdf},\nabstract={In this paper, we propose a new inertial viscosity iterative algorithm for solving the variational inequality problem with a pseudo-monotone operator and the fixed point problem involving a nonexpansive mapping in real Hilbert spaces. The advantage of the proposed algorithm is that it can work without the prior knowledge of the Lipschitz constant of the mapping. The strong convergence of the sequence generated by the proposed algorithm is proved under some suitable assumptions imposed on the parameters. Some numerical experiments are given to support our main results.},\nkeywords={Inertial method,  Viscosity method,  Strong convergence, Variational inequality problem, Fixed point problem, Nonexpansive mapping, Pseudomonotone operator},\nabbrev_source_title={J. Ind. Manag. Optim.},\n}\n\n
\n
\n\n\n
\n In this paper, we propose a new inertial viscosity iterative algorithm for solving the variational inequality problem with a pseudo-monotone operator and the fixed point problem involving a nonexpansive mapping in real Hilbert spaces. The advantage of the proposed algorithm is that it can work without the prior knowledge of the Lipschitz constant of the mapping. The strong convergence of the sequence generated by the proposed algorithm is proved under some suitable assumptions imposed on the parameters. Some numerical experiments are given to support our main results.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n Wang, X.\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Tan, B.; Qin, X.; and Wang, X.\n\n\n \n \n \n Alternated inertial algorithms for split feasibility problems.\n \n \n\n\n \n\n\n\n Numerical Algorithms, 95(2): 773–812. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"AlternatedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TQW_NUMA24,\nauthor={Tan, Bing and Qin, Xiaolong and Wang, Xianfu},\ntitle={Alternated inertial algorithms for split feasibility problems},\njournal={Numerical Algorithms},\nyear={2024},\nvolume={95},\nnumber={2},\npages={773--812},\ndoi={10.1007/s11075-023-01589-8},\nurl={https://bingtan.me/files/paper/TQW-NUMA2024.pdf},\nabstract={We introduce four novel relaxed CQ algorithms with alternating inertial for solving split feasibility problems in real Hilbert spaces. The proposed algorithms employ a new non-monotonic adaptive step size criterion and utilize two different step sizes in each iteration. The weak convergence of the iterative sequences generated by the proposed algorithms is established under some weak conditions. Moreover, the Fejér monotonicity of the even subsequence with respect to the solution set is recovered. Two applications in signal denoising and image deblurring are given to illustrate the computational efficiency of our algorithms.},\nkeywords={Split feasibility problem,  CQ method,  Projection and contraction method,  Alternated inertial method,  Signal processing,  Image restoration},\nabbrev_source_title={Numer. Algorithms},\n}\n\n
\n
\n\n\n
\n We introduce four novel relaxed CQ algorithms with alternating inertial for solving split feasibility problems in real Hilbert spaces. The proposed algorithms employ a new non-monotonic adaptive step size criterion and utilize two different step sizes in each iteration. The weak convergence of the iterative sequences generated by the proposed algorithms is established under some weak conditions. Moreover, the Fejér monotonicity of the even subsequence with respect to the solution set is recovered. Two applications in signal denoising and image deblurring are given to illustrate the computational efficiency of our algorithms.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n Wang, Y.\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Hu, S.; Wang, Y.; Tan, B.; and Wang, F.\n\n\n \n \n \n Inertial iterative method for solving variational inequality problems of pseudo-monotone operators and fixed point problems of nonexpansive mappings in Hilbert spaces.\n \n \n\n\n \n\n\n\n Journal of Industrial and Management Optimization, 19(4): 2655–2675. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{HWTW_JIMO23,\nauthor={Hu, Shaotao and Wang, Yuanheng and Tan, Bing and Wang, Fenghui},\ntitle={Inertial iterative method for solving variational inequality problems of pseudo-monotone operators and fixed point problems of nonexpansive mappings in {H}ilbert spaces},\njournal={Journal of Industrial and Management Optimization},\nyear={2023},\nvolume={19},\nnumber={4},\npages={2655--2675},\ndoi={10.3934/jimo.2022060},\nurl={https://bingtan.me/files/paper/HWTW-JIMO2023.pdf},\nabstract={In this paper, we propose a new inertial viscosity iterative algorithm for solving the variational inequality problem with a pseudo-monotone operator and the fixed point problem involving a nonexpansive mapping in real Hilbert spaces. The advantage of the proposed algorithm is that it can work without the prior knowledge of the Lipschitz constant of the mapping. The strong convergence of the sequence generated by the proposed algorithm is proved under some suitable assumptions imposed on the parameters. Some numerical experiments are given to support our main results.},\nkeywords={Inertial method,  Viscosity method,  Strong convergence, Variational inequality problem, Fixed point problem, Nonexpansive mapping, Pseudomonotone operator},\nabbrev_source_title={J. Ind. Manag. Optim.},\n}\n\n
\n
\n\n\n
\n In this paper, we propose a new inertial viscosity iterative algorithm for solving the variational inequality problem with a pseudo-monotone operator and the fixed point problem involving a nonexpansive mapping in real Hilbert spaces. The advantage of the proposed algorithm is that it can work without the prior knowledge of the Lipschitz constant of the mapping. The strong convergence of the sequence generated by the proposed algorithm is proved under some suitable assumptions imposed on the parameters. Some numerical experiments are given to support our main results.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n Xie, Z.\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Xie, Z.; Cai, G.; and Tan, B.\n\n\n \n \n \n Inertial subgradient extragradient method for solving pseudomonotone equilibrium probelms and fixed point problems in Hilbert spaces.\n \n \n\n\n \n\n\n\n Optimization, 73(5): 1329-1354. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{XCT_OPT24,\nauthor={Xie, Zhongbing and Cai, Gang and Tan, Bing},\ntitle={Inertial subgradient extragradient method for solving pseudomonotone equilibrium probelms and fixed point problems in Hilbert spaces},\njournal={Optimization},\nyear={2024},\nvolume={73},\nnumber={5},\npages={1329-1354},\ndoi={10.1080/02331934.2022.2157677},\nurl={https://bingtan.me/files/paper/XCT-OPT2024.pdf},\nabstract={This paper proposes a new inertial subgradient extragradient method for solving equilibrium problems with pseudomonotone and Lipschitz-type bifunctions and fixed point problems for nonexpansive mappings in real Hilbert spaces. Precisely, we prove that the sequence generated by proposed algorithm converges strongly to a common solution of equilibrium problems and fixed point problems. We use an effective self-adaptive step size rule to accelerate the convergence process of our proposed iterative algorithm. Moreover, some numerical results are given to show the effectiveness of the proposed algorithm. The results obtained in this paper extend and improve many recent ones in the literature.},\nkeywords={Inertial method,  Subgradient extragradient method, Equilibrium probelm, Fixed point problem, Strong convergence},\nabbrev_source_title={Optimization},\n}\n\n
\n
\n\n\n
\n This paper proposes a new inertial subgradient extragradient method for solving equilibrium problems with pseudomonotone and Lipschitz-type bifunctions and fixed point problems for nonexpansive mappings in real Hilbert spaces. Precisely, we prove that the sequence generated by proposed algorithm converges strongly to a common solution of equilibrium problems and fixed point problems. We use an effective self-adaptive step size rule to accelerate the convergence process of our proposed iterative algorithm. Moreover, some numerical results are given to show the effectiveness of the proposed algorithm. The results obtained in this paper extend and improve many recent ones in the literature.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n Xu, S.\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n Tan, B.; and Xu, S.\n\n\n \n \n \n Strong convergence of two inertial projection algorithms in Hilbert spaces.\n \n \n\n\n \n\n\n\n Journal of Applied and Numerical Optimization, 2(2): 171–186. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"StrongPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TX_JANO20,\nauthor={Tan, Bing and Xu, Shanshan},\ntitle={Strong convergence of two inertial projection algorithms in {H}ilbert spaces},\njournal={Journal of Applied and Numerical Optimization},\nyear={2020},\nvolume={2},\nnumber={2},\npages={171--186},\ndoi={10.23952/jano.2.2020.2.04},\nurl={https://bingtan.me/files/paper/TX-JANO2020.pdf},\nabstract={In this paper, we propose two inertial projection algorithms for finding a common solution of monotone variational inclusions and hierarchical fixed point problems of nonexpansive mappings. We obtain two strong convergence theorems under some suitable conditions in Hilbert spaces. In addition, we also give numerical examples to compare our algorithms with the existing ones. Numerical results show that our proposed algorithms are efficient and robust.},\nkeywords={Hierarchical fixed point problem,  Inertial method,  Monotone operator,  Strong convergence,  Inclusion problem},\nabbrev_source_title={J. Appl. Numer. Optim.},\n}\n\n
\n
\n\n\n
\n In this paper, we propose two inertial projection algorithms for finding a common solution of monotone variational inclusions and hierarchical fixed point problems of nonexpansive mappings. We obtain two strong convergence theorems under some suitable conditions in Hilbert spaces. In addition, we also give numerical examples to compare our algorithms with the existing ones. Numerical results show that our proposed algorithms are efficient and robust.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Xu, S.; and Li, S.\n\n\n \n \n \n Inertial shrinking projection algorithms for solving hierarchical variational inequality problems.\n \n \n\n\n \n\n\n\n Journal of Nonlinear and Convex Analysis, 21(4): 871–884. 2020.\n \n\n(ESI Highly Cited Paper)\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TXL_JNCA20_2,\nauthor={Tan, Bing and Xu, Shanshan and Li, Songxiao},\ntitle={Inertial shrinking projection algorithms for solving hierarchical variational inequality problems},\njournal={Journal of Nonlinear and Convex Analysis},\nyear={2020},\nvolume={21},\nnumber={4},\npages={871--884},\nurl={https://bingtan.me/files/paper/TXL-JNCA2020.pdf},\nabstract={In this paper, we propose two inertial shrinking algorithms to approximate a solution of hierarchical variational inequality problems with nonex-pansive mappings in Hilbert spaces. We prove strong convergence theorems under some mild conditions. Finally, we present some numerical examples to compare our algorithms with some existing algorithms, which illustrate the advantage of our proposed algorithms.},\nkeywords={Hierarchical variational inequality problem,  Inertial method, Mann method,  Nonexpansive mapping,  Shrinking projection method,  Strong convergence},\nabbrev_source_title={J. Nonlinear Convex Anal.},\nbibbase_note={<span style="color: red">(<s>ESI Highly Cited Paper</s>)</span>},\n}\n\n
\n
\n\n\n
\n In this paper, we propose two inertial shrinking algorithms to approximate a solution of hierarchical variational inequality problems with nonex-pansive mappings in Hilbert spaces. We prove strong convergence theorems under some mild conditions. Finally, we present some numerical examples to compare our algorithms with some existing algorithms, which illustrate the advantage of our proposed algorithms.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Xu, S.; and Li, S.\n\n\n \n \n \n Inertial hybrid and shrinking projection algorithms for solving variational inequality problems.\n \n \n\n\n \n\n\n\n Journal of Nonlinear and Convex Analysis, 21(10): 2193–2206. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TXL_JNCA20_1,\nauthor={Tan, Bing and Xu, Shanshan and Li, Songxiao},\ntitle={Inertial hybrid and shrinking projection algorithms for solving variational inequality problems},\njournal={Journal of Nonlinear and Convex Analysis},\nyear={2020},\nvolume={21},\nnumber={10},\npages={2193--2206},\nurl={https://bingtan.me/files/paper/TXL-JNCA2020-10.pdf},\nabstract={In this paper, we propose two inertial hybrid and shrinking projection algorithms for strict pseudo-contractions in Hilbert spaces and obtain strong theorems in general conditions. In addition, we also propose two new inertial hybrid and shrinking projection algorithms without extrapolating step for non-expansive mappings in Hilbert spaces and get strong convergence results. Finally, we give some numerical examples to illustrate the computational performance of our proposed algorithms.},\nkeywords={Variational inequality problem,  Inertial method, Hybrid projection method, Shrinking projection method, Strong convergence},\nabbrev_source_title={J. Nonlinear Convex Anal.},\n}\n\n
\n
\n\n\n
\n In this paper, we propose two inertial hybrid and shrinking projection algorithms for strict pseudo-contractions in Hilbert spaces and obtain strong theorems in general conditions. In addition, we also propose two new inertial hybrid and shrinking projection algorithms without extrapolating step for non-expansive mappings in Hilbert spaces and get strong convergence results. Finally, we give some numerical examples to illustrate the computational performance of our proposed algorithms.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Xu, S.; and Li, S.\n\n\n \n \n \n Modified inertial hybrid and shrinking projection algorithms for solving fixed point problems.\n \n \n\n\n \n\n\n\n Mathematics, 8(2): 236. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"ModifiedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TXL_MATH20,\nauthor={Tan, Bing and Xu, Shanshan and Li, Songxiao},\ntitle={Modified inertial hybrid and shrinking projection algorithms for solving fixed point problems},\njournal={Mathematics},\nyear={2020},\nvolume={8},\nnumber={2},\ndoi={10.3390/math8020236},\npages={236},\nurl={https://bingtan.me/files/paper/TXL-Math2020.pdf},\nabstract={In this paper, we introduce two modified inertial hybrid and shrinking projection algorithms for solving fixed point problems by combining the modified inertial Mann algorithm with the projection algorithm. We establish strong convergence theorems under certain suitable conditions. Finally, our algorithms are applied to convex feasibility problem, variational inequality problem, and location theory. The algorithms and results presented in this paper can summarize and unify corresponding results previously known in this field.},\nkeywords={Conjugate gradient method,  Hybrid projection method,  Inertial method,  Nonexpansive mapping,  Shrinking projection method,  Hybrid steepest descent method,  Strong convergence},\nabbrev_source_title={Mathematics},\n}\n\n
\n
\n\n\n
\n In this paper, we introduce two modified inertial hybrid and shrinking projection algorithms for solving fixed point problems by combining the modified inertial Mann algorithm with the projection algorithm. We establish strong convergence theorems under certain suitable conditions. Finally, our algorithms are applied to convex feasibility problem, variational inequality problem, and location theory. The algorithms and results presented in this paper can summarize and unify corresponding results previously known in this field.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n Yao, J.\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n Tan, B.; Qin, X.; and Yao, J. C.\n\n\n \n \n \n Strong convergence of inertial projection and contraction methods for pseudomonotone variational inequalities with applications to optimal control problems.\n \n \n\n\n \n\n\n\n Journal of Global Optimization, 82(3): 523–557. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"StrongPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TQY_JOGO22,\nauthor={Tan, Bing and Qin, Xiaolong and Yao, Jen C.},\ntitle={Strong convergence of inertial projection and contraction methods for pseudomonotone variational inequalities with applications to optimal control problems},\njournal={Journal of Global Optimization},\nyear={2022},\nvolume={82},\nnumber={3},\npages={523--557},\ndoi={10.1007/s10898-021-01095-y},\nurl={https://bingtan.me/files/paper/TQY-JOGO2022.pdf},\nabstract={This paper investigates some inertial projection and contraction methods for solving pseudomonotone variational inequality problems in real Hilbert spaces. The algorithms use a new non-monotonic step size so that they can work without the prior knowledge of the Lipschitz constant of the operator. Strong convergence theorems of the suggested algorithms are obtained under some suitable conditions. Some numerical experiments in finite- and infinite-dimensional spaces and applications in optimal control problems are implemented to demonstrate the performance of the suggested schemes and we also compare them with several related results.},\nkeywords={Inertial method,  Optimal control problem,  Projection and contraction method,  Pseudomonotone operator,  Subgradient extragradient method,  Variational inequality problem},\nabbrev_source_title={J. Global Optim.},\n}\n\n
\n
\n\n\n
\n This paper investigates some inertial projection and contraction methods for solving pseudomonotone variational inequality problems in real Hilbert spaces. The algorithms use a new non-monotonic step size so that they can work without the prior knowledge of the Lipschitz constant of the operator. Strong convergence theorems of the suggested algorithms are obtained under some suitable conditions. Some numerical experiments in finite- and infinite-dimensional spaces and applications in optimal control problems are implemented to demonstrate the performance of the suggested schemes and we also compare them with several related results.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Petruşel, A.; Qin, X.; and Yao, J. C.\n\n\n \n \n \n Global and linear convergence of alternated inertial single projection algorithms for pseudo-monotone variational inequalities.\n \n \n\n\n \n\n\n\n Fixed Point Theory, 23(1): 391–426. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"GlobalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TPQY_FPT22,\nauthor={Tan, Bing and Petruşel, Adrian and Qin, Xiaolong and Yao, Jen C.},\ntitle={Global and linear convergence of alternated inertial single projection algorithms for pseudo-monotone variational inequalities},\njournal={Fixed Point Theory},\nyear={2022},\nvolume={23},\nnumber={1},\npages={391--426},\ndoi={10.24193/fpt-ro.2022.1.25},\nurl={https://bingtan.me/files/paper/TPQY-FPT2022.pdf},\nabstract={In this paper, we investigate three new relaxed single projection methods with alternating inertial extrapolation steps and adaptive non-monotonic step sizes for solving pseudo-monotone variational inequalities in real Hilbert spaces. The proposed algorithms need to compute the projection on the feasible set only once in each iteration and they can work adaptively without the prior information of the Lipschitz constant of the mapping. The weak convergence theorems of the proposed iterative schemes are established under some appropriate conditions imposed on the parameters. These methods recover the Fejér monotonicity of the even subsequence with respect to the solution and obtain linear convergence rates. Finally, some numerical experiments and applications to optimal control problems are provided to demonstrate the advantages and efficiency of the proposed methods compared to some recent related ones.},\nkeywords={Adaptive stepsize,  Alternated inertial method,  Projection and contraction method,  Pseudomonotone operator,  Subgradient extragradient method,  Variational inequality problem},\nabbrev_source_title={Fixed Point Theory},\n}\n\n
\n
\n\n\n
\n In this paper, we investigate three new relaxed single projection methods with alternating inertial extrapolation steps and adaptive non-monotonic step sizes for solving pseudo-monotone variational inequalities in real Hilbert spaces. The proposed algorithms need to compute the projection on the feasible set only once in each iteration and they can work adaptively without the prior information of the Lipschitz constant of the mapping. The weak convergence theorems of the proposed iterative schemes are established under some appropriate conditions imposed on the parameters. These methods recover the Fejér monotonicity of the even subsequence with respect to the solution and obtain linear convergence rates. Finally, some numerical experiments and applications to optimal control problems are provided to demonstrate the advantages and efficiency of the proposed methods compared to some recent related ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Cho, S. Y.; and Yao, J. C.\n\n\n \n \n \n Accelerated inertial subgradient extragradient algorithms with non-monotonic step sizes for equilibrium problems and fixed point problems.\n \n \n\n\n \n\n\n\n Journal of Nonlinear and Variational Analysis, 6(1): 89–122. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"AcceleratedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TCY_JNVA22,\nauthor={Tan, Bing and Cho, Sun Y. and Yao, Jen C.},\ntitle={Accelerated inertial subgradient extragradient algorithms with non-monotonic step sizes for equilibrium problems and fixed point problems},\njournal={Journal of Nonlinear and Variational Analysis},\nyear={2022},\nvolume={6},\nnumber={1},\npages={89--122},\ndoi={10.23952/jnva.6.2022.1.06},\nurl={https://bingtan.me/files/paper/TCY-JNVA2022.pdf},\nabstract={This paper introduces several new accelerated subgradient extragradient methods with inertial effects for approximating a solution of a pseudomonotone equilibrium problem and a fixed point problem involving a quasi-nonexpansive mapping or a demicontractive mapping in real Hilbert spaces. The proposed algorithms use an adaptive non-monotonic step size criterion that does not include any Armijo line search process. Strong convergence theorems of the suggested iterative algorithms are established without the prior knowledge of the Lipschitz constants of the bifunction. Moreover, $R$-linear convergence is guaranteed under the assumption that the bifunction satisfies strong pseudomonotonicity. Applications to variational inequality problems are also considered. Finally, some numerical examples and applications, which demonstrate the advantages and efficiency of the proposed algorithms, are given.},\nkeywords={Equilibrium problem,  Fixed point problem,  Inertial method,  Pseudomonotone bifunction,  Subgradient extragradient method},\nabbrev_source_title={J. Nonlinear Var. Anal.},\n}\n\n
\n
\n\n\n
\n This paper introduces several new accelerated subgradient extragradient methods with inertial effects for approximating a solution of a pseudomonotone equilibrium problem and a fixed point problem involving a quasi-nonexpansive mapping or a demicontractive mapping in real Hilbert spaces. The proposed algorithms use an adaptive non-monotonic step size criterion that does not include any Armijo line search process. Strong convergence theorems of the suggested iterative algorithms are established without the prior knowledge of the Lipschitz constants of the bifunction. Moreover, $R$-linear convergence is guaranteed under the assumption that the bifunction satisfies strong pseudomonotonicity. Applications to variational inequality problems are also considered. Finally, some numerical examples and applications, which demonstrate the advantages and efficiency of the proposed algorithms, are given.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Qin, X.; and Yao, J. C.\n\n\n \n \n \n Strong convergence of self-adaptive inertial algorithms for solving split variational inclusion problems with applications.\n \n \n\n\n \n\n\n\n Journal of Scientific Computing, 87(1): 20. 2021.\n \n\n(ESI Highly Cited Paper)\n\n
\n\n\n\n \n \n \"StrongPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TQY_JSC21,\nauthor={Tan, Bing and Qin, Xiaolong and Yao, Jen C.},\ntitle={Strong convergence of self-adaptive inertial algorithms for solving split variational inclusion problems with applications},\njournal={Journal of Scientific Computing},\nyear={2021},\nvolume={87},\nnumber={1},\ndoi={10.1007/s10915-021-01428-9},\npages={20},\nurl={https://bingtan.me/files/paper/TQY-JSC2021.pdf},\nabstract={In this paper, four self-adaptive iterative algorithms with inertial effects are introduced to solve a split variational inclusion problem in real Hilbert spaces. One of the advantages of the suggested algorithms is that they can work without knowing the prior information of the operator norm. Strong convergence theorems of these algorithms are established under mild and standard assumptions. As applications, the split feasibility problem and the split minimization problem in real Hilbert spaces are studied. Finally, several preliminary numerical experiments as well as an example in the field of compressed sensing are proposed to support the advantages and efficiency of the suggested methods over some existing ones.},\nkeywords={Inertial method,  Mann method,  Signal processing problem,  Split variational inclusion problem,  Strong convergence,  Viscosity method},\nabbrev_source_title={J. Sci. Comput.},\nbibbase_note={<span style="color: red">(ESI Highly Cited Paper)</span>},\n}\n\n
\n
\n\n\n
\n In this paper, four self-adaptive iterative algorithms with inertial effects are introduced to solve a split variational inclusion problem in real Hilbert spaces. One of the advantages of the suggested algorithms is that they can work without knowing the prior information of the operator norm. Strong convergence theorems of these algorithms are established under mild and standard assumptions. As applications, the split feasibility problem and the split minimization problem in real Hilbert spaces are studied. Finally, several preliminary numerical experiments as well as an example in the field of compressed sensing are proposed to support the advantages and efficiency of the suggested methods over some existing ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Qin, X.; and Yao, J. C.\n\n\n \n \n \n Two modified inertial projection algorithms for bilevel pseudomonotone variational inequalities with applications to optimal control problems.\n \n \n\n\n \n\n\n\n Numerical Algorithms, 88(4): 1757–1786. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"TwoPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TQY_NUMA21,\nauthor={Tan, Bing and Qin, Xiaolong and Yao, Jen C.},\ntitle={Two modified inertial projection algorithms for bilevel pseudomonotone variational inequalities with applications to optimal control problems},\njournal={Numerical Algorithms},\nyear={2021},\nvolume={88},\nnumber={4},\npages={1757--1786},\ndoi={10.1007/s11075-021-01093-x},\nurl={https://bingtan.me/files/paper/TQY-NUMA2021.pdf},\nabstract={In this paper, we investigate two new algorithms for solving bilevel pseudomonotone variational inequality problems in real Hilbert spaces. The advantages of our algorithms are that they only need to calculate one projection on the feasible set in each iteration, and do not require the prior information of the Lipschitz constant of the cost operator. Furthermore, two new algorithms are derived to solve variational inequality problems. We establish the strong convergence of the proposed algorithms under some suitable conditions imposed on parameters. Finally, several numerical results and applications in optimal control problems are reported to illustrate the efficiency and advantages of the proposed algorithms.},\nkeywords={Bilevel variational inequality problem,  Hybrid steepest descent method,  Inertial extragradient method,  Projection and contraction method,  Pseudomonotone operator},\nabbrev_source_title={Numer. Algorithms},\n}\n\n
\n
\n\n\n
\n In this paper, we investigate two new algorithms for solving bilevel pseudomonotone variational inequality problems in real Hilbert spaces. The advantages of our algorithms are that they only need to calculate one projection on the feasible set in each iteration, and do not require the prior information of the Lipschitz constant of the cost operator. Furthermore, two new algorithms are derived to solve variational inequality problems. We establish the strong convergence of the proposed algorithms under some suitable conditions imposed on parameters. Finally, several numerical results and applications in optimal control problems are reported to illustrate the efficiency and advantages of the proposed algorithms.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n Zhou, X.\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Zhou, X.; Cai, G.; Tan, B.; and Dong, Q. L.\n\n\n \n \n \n A modified generalized version of projected reflected gradient method in Hilbert spaces.\n \n \n\n\n \n\n\n\n Numerical Algorithms, doi:10.1007/s11075-023-01566-1. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{ZCTD_NUMA23,\nauthor={Zhou, Xiaolin and Cai, Gang and Tan, Bing and Dong, Qiao L.},\ntitle={A modified generalized version of projected reflected gradient method in Hilbert spaces},\njournal={Numerical Algorithms},\nyear={2023},\nvolume={doi:10.1007/s11075-023-01566-1},\ndoi={10.1007/s11075-023-01566-1},\nurl={https://bingtan.me/files/paper/ZCTD-NUMA2023.pdf},\nabstract={This article is concerned with a universal version of projected reflected gradient method with new step size for solving variational inequality problem in Hilbert spaces. Under appropriate assumptions controlled by the operators and parameters, we acquire the weak convergence of the proposed algorithm. We establish an R-linear convergence rate of our method on the condition that the relevant mapping is strongly monotone. We rework our first algorithm so that it can be simplified to several generalized methods in the literature. The efficacy and availability of our proposed iterative scheme are demonstrated in numerical experiments.},\nkeywords={Projected reflected gradient method, Variational inequality, Weak and linear convergence, Hilbert spaces},\nabbrev_source_title={Numer. Algorithms},\n}\n\n
\n
\n\n\n
\n This article is concerned with a universal version of projected reflected gradient method with new step size for solving variational inequality problem in Hilbert spaces. Under appropriate assumptions controlled by the operators and parameters, we acquire the weak convergence of the proposed algorithm. We establish an R-linear convergence rate of our method on the condition that the relevant mapping is strongly monotone. We rework our first algorithm so that it can be simplified to several generalized methods in the literature. The efficacy and availability of our proposed iterative scheme are demonstrated in numerical experiments.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n Zhou, Z.\n \n \n (10)\n \n \n
\n
\n \n \n
\n \n\n \n \n Zhou, Z.; Tan, B.; and Li, S.\n\n\n \n \n \n Inertial algorithms with adaptive stepsizes for split variational inclusion problems and their applications to signal recovery problem.\n \n \n\n\n \n\n\n\n Mathematical Methods in the Applied Sciences, doi:10.1002/mma.9436. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"InertialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{ZTL_MMAS23,\nauthor={Zhou, Zheng and Tan, Bing and Li, Songxiao},\ntitle={Inertial algorithms with adaptive stepsizes for split variational inclusion problems and their applications to signal recovery problem},\njournal={Mathematical Methods in the Applied Sciences},\nyear={2023},\nvolume={doi:10.1002/mma.9436},\ndoi={10.1002/mma.9436},\nurl={https://bingtan.me/files/paper/ZTL-MMAS2023.pdf},\nabstract={With the help of the Meir-Keeler contraction method and the Mann-type method, two adaptive inertial iterative schemes are introduced for finding solutions of the split variational inclusion problem in Hilbert spaces. The strong convergence of the suggested algorithms is guaranteed by a new stepsize criterion that does not require calculation of the bounded linear operator norm. Some numerical experiments and applications in signal recovery problems are given to demonstrate the efficiency of the proposed algorithms.},\nkeywords={Adaptive stepsize, Inertial method, Mann method, Meir-Keeler contraction, Signal recovery, Split variational inclusion problem},\nabbrev_source_title={Math. Methods Appl. Sci.},\n}\n\n
\n
\n\n\n
\n With the help of the Meir-Keeler contraction method and the Mann-type method, two adaptive inertial iterative schemes are introduced for finding solutions of the split variational inclusion problem in Hilbert spaces. The strong convergence of the suggested algorithms is guaranteed by a new stepsize criterion that does not require calculation of the bounded linear operator norm. Some numerical experiments and applications in signal recovery problems are given to demonstrate the efficiency of the proposed algorithms.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Zhou, Z.; and Li, S.\n\n\n \n \n \n Viscosity-type inertial extragradient algorithms for solving variational inequality problems and fixed point problems.\n \n \n\n\n \n\n\n\n Journal of Applied Mathematics and Computing, 68(2): 1387–1411. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"Viscosity-typePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TZL_JAMC22,\nauthor={Tan, Bing and Zhou, Zheng and Li, Songxiao},\ntitle={Viscosity-type inertial extragradient algorithms for solving variational inequality problems and fixed point problems},\njournal={Journal of Applied Mathematics and Computing},\nyear={2022},\nvolume={68},\nnumber={2},\npages={1387--1411},\ndoi={10.1007/s12190-021-01576-z},\nurl={https://bingtan.me/files/paper/TZL-JAMC2022.pdf},\nabstract={The paper presents two inertial viscosity-type extragradient algorithms for finding a common solution of the variational inequality problem involving a monotone and Lipschitz continuous operator and of the fixed point problem with a demicontractive mapping in real Hilbert spaces. Our algorithms use a simple step size rule which is generated by some calculations at each iteration. Two strong convergence theorems are obtained without the prior knowledge of the Lipschitz constant of the operator. The numerical behaviors of the proposed algorithms in some numerical experiments are reported and compared with previously known ones.},\nkeywords={Fixed point problem,  Inertial method,  Subgradient extragradient method,  Tseng's extragradient method,  Variational inequality problem},\nabbrev_source_title={J. Appl. Math. Comput.},\n}\n\n
\n
\n\n\n
\n The paper presents two inertial viscosity-type extragradient algorithms for finding a common solution of the variational inequality problem involving a monotone and Lipschitz continuous operator and of the fixed point problem with a demicontractive mapping in real Hilbert spaces. Our algorithms use a simple step size rule which is generated by some calculations at each iteration. Two strong convergence theorems are obtained without the prior knowledge of the Lipschitz constant of the operator. The numerical behaviors of the proposed algorithms in some numerical experiments are reported and compared with previously known ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Zhou, Z.; Tan, B.; and Li, S.\n\n\n \n \n \n Adaptive hybrid steepest descent algorithms involving an inertial extrapolation term for split monotone variational inclusion problems.\n \n \n\n\n \n\n\n\n Mathematical Methods in the Applied Sciences, 45(15): 8835–8853. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"AdaptivePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{ZTL_MMAS22,\nauthor={Zhou, Zheng and Tan, Bing and Li, Songxiao},\ntitle={Adaptive hybrid steepest descent algorithms involving an inertial extrapolation term for split monotone variational inclusion problems},\njournal={Mathematical Methods in the Applied Sciences},\nyear={2022},\nvolume={45},\nnumber={15},\npages={8835--8853},\ndoi={10.1002/mma.7931},\nurl={https://bingtan.me/files/paper/ZTL-MMAS2022.pdf},\nabstract={In this paper, we discuss the split monotone variational inclusion problem and propose two new inertial algorithms in infinite-dimensional Hilbert spaces. The iterative sequence by the proposed algorithms converges strongly to the solution of a certain variational inequality with the help of the hybrid steepest descent method. Furthermore, an adaptive step size criterion is considered in suggested algorithms to avoid the difficulty of calculating the operator norm. Meanwhile, our results are also applied to several other types of split problems. Finally, some numerical experiments show that our algorithms are realistic and summarize the known results.},\nkeywords={Adaptive stepsize,  Hybrid steepest descent method,  Inertial method,  Signal processing problem,  Strong convergence},\nabbrev_source_title={Math. Methods Appl. Sci.},\n}\n\n
\n
\n\n\n
\n In this paper, we discuss the split monotone variational inclusion problem and propose two new inertial algorithms in infinite-dimensional Hilbert spaces. The iterative sequence by the proposed algorithms converges strongly to the solution of a certain variational inequality with the help of the hybrid steepest descent method. Furthermore, an adaptive step size criterion is considered in suggested algorithms to avoid the difficulty of calculating the operator norm. Meanwhile, our results are also applied to several other types of split problems. Finally, some numerical experiments show that our algorithms are realistic and summarize the known results.\n
\n\n\n
\n\n\n
\n \n\n \n \n Zhou, Z.; Tan, B.; and Cho, S. Y.\n\n\n \n \n \n Alternated inertial subgradient extragradient methods for solving variational inequalities.\n \n \n\n\n \n\n\n\n Journal of Nonlinear and Convex Analysis, 23(11): 2593–2604. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"AlternatedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{ZTC_JNCA22,\nauthor={Zhou, Zheng and Tan, Bing and Cho, Sun Y.},\ntitle={Alternated inertial subgradient extragradient methods for solving variational inequalities},\njournal={Journal of Nonlinear and Convex Analysis},\nyear={2022},\nvolume={23},\nnumber={11},\npages={2593--2604},\nurl={https://bingtan.me/files/paper/ZTC-JNCA2022.pdf},\nabstract={The goal of this paper is to study some iterative algorithms for solving a pseudomonotone variational inequality in Hilbert spaces. The iterative algorithms presented in this paper are based on the alternated inertial method and the subgradient extragradient method. Weak convergence of the algorithms is established by the adaptive stepsize criterion in Hilbert spaces.},\nkeywords={Alternated inertial method, Pseudomonotone operator,  Variational inequality problem, Subgradient extragradient method},\nabbrev_source_title={J. Nonlinear Convex Anal.},\n}\n\n
\n
\n\n\n
\n The goal of this paper is to study some iterative algorithms for solving a pseudomonotone variational inequality in Hilbert spaces. The iterative algorithms presented in this paper are based on the alternated inertial method and the subgradient extragradient method. Weak convergence of the algorithms is established by the adaptive stepsize criterion in Hilbert spaces.\n
\n\n\n
\n\n\n
\n \n\n \n \n Zhou, Z.; Tan, B.; and Li, S.\n\n\n \n \n \n Two self-adaptive inertial projection algorithms for solving split variational inclusion problems.\n \n \n\n\n \n\n\n\n AIMS Mathematics, 7(4): 4960–4973. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"TwoPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{ZTL_AIMS22,\nauthor={Zhou, Zheng and Tan, Bing and Li, Songxiao},\ntitle={Two self-adaptive inertial projection algorithms for solving split variational inclusion problems},\njournal={AIMS Mathematics},\nyear={2022},\nvolume={7},\nnumber={4},\npages={4960--4973},\ndoi={10.3934/math.2022276},\nurl={https://bingtan.me/files/paper/ZTL-AIMS2022.pdf},\nabstract={This paper is to analyze the approximation solution of a split variational inclusion problem in the framework of Hilbert spaces. For this purpose, inertial hybrid and shrinking projection algorithms are proposed under the effect of a self-adaptive stepsize which does not require information of the norms of the given operators. The strong convergence properties of the proposed algorithms are obtained under mild constraints. Finally, a numerical experiment is given to illustrate the performance of proposed methods and to compare our algorithms with an existing algorithm.},\nkeywords={Inertial method,  Adaptive stepsize,  Split variational inclusion problem},\nabbrev_source_title={AIMS Math.},\n}\n\n
\n
\n\n\n
\n This paper is to analyze the approximation solution of a split variational inclusion problem in the framework of Hilbert spaces. For this purpose, inertial hybrid and shrinking projection algorithms are proposed under the effect of a self-adaptive stepsize which does not require information of the norms of the given operators. The strong convergence properties of the proposed algorithms are obtained under mild constraints. Finally, a numerical experiment is given to illustrate the performance of proposed methods and to compare our algorithms with an existing algorithm.\n
\n\n\n
\n\n\n
\n \n\n \n \n Zhou, Z.; Tan, B.; and Li, S.\n\n\n \n \n \n An accelerated hybrid projection method with a self-adaptive step-size sequence for solving split common fixed point problems.\n \n \n\n\n \n\n\n\n Mathematical Methods in the Applied Sciences, 44(8): 7294–7303. 2021.\n \n\n(ESI Highly Cited Paper)\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{ZTL_MMAS21,\nauthor={Zhou, Zheng and Tan, Bing and Li, Songxiao},\ntitle={An accelerated hybrid projection method with a self-adaptive step-size sequence for solving split common fixed point problems},\njournal={Mathematical Methods in the Applied Sciences},\nyear={2021},\nvolume={44},\nnumber={8},\npages={7294--7303},\ndoi={10.1002/mma.7261},\nurl={https://bingtan.me/files/paper/ZTL-MMAS2021.pdf},\nabstract={This paper attempts to solve the split common fixed point problem for demicontractive mappings. We give an accelerated hybrid projection algorithm that combines the hybrid projection method and the inertial technique. The strong convergence theorem of this algorithm is obtained under mild conditions by a self-adaptive step-size sequence, which does not need prior knowledge of the operator norm. Some numerical experiments in infinite-dimensional Hilbert spaces are provided to illustrate the reliability and robustness of the algorithm and also to compare it with existing ones.},\nkeywords={Demicontractive mapping,  Hybrid projection method,  Inertial method,  Split common fixed point problem},\nabbrev_source_title={Math. Methods Appl. Sci.},\nbibbase_note={<span style="color: red">(<s>ESI Highly Cited Paper</s>)</span>},\n}\n\n
\n
\n\n\n
\n This paper attempts to solve the split common fixed point problem for demicontractive mappings. We give an accelerated hybrid projection algorithm that combines the hybrid projection method and the inertial technique. The strong convergence theorem of this algorithm is obtained under mild conditions by a self-adaptive step-size sequence, which does not need prior knowledge of the operator norm. Some numerical experiments in infinite-dimensional Hilbert spaces are provided to illustrate the reliability and robustness of the algorithm and also to compare it with existing ones.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Zhou, Z.; and Qin, X.\n\n\n \n \n \n Accelerated projection-based forward-backward splitting algorithms for monotone inclusion problems.\n \n \n\n\n \n\n\n\n Journal of Applied Analysis and Computation, 10(5): 2184–2197. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"AcceleratedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TZQ_JAAC20,\nauthor={Tan, Bing and Zhou, Zheng and Qin, Xiaolong},\ntitle={Accelerated projection-based forward-backward splitting algorithms for monotone inclusion problems},\njournal={Journal of Applied Analysis and Computation},\nyear={2020},\nvolume={10},\nnumber={5},\npages={2184--2197},\ndoi={10.11948/20190363},\nurl={https://bingtan.me/files/paper/TZQ-JAAC2020.pdf},\nabstract={In this paper, based on inertial and Tseng's ideas, we propose two projection-based algorithms to solve a monotone inclusion problem in infinite dimensional Hilbert spaces. Solution theorems of strong convergence are obtained under the certain conditions. Some numerical experiments are presented to illustrate that our algorithms are efficient than the existing results.},\nkeywords={Forward-backward splitting algorithm,  Inclusion problem,  Monotone operator,  Strong convergence},\nabbrev_source_title={J. Appl. Anal. Comput.},\n}\n\n
\n
\n\n\n
\n In this paper, based on inertial and Tseng's ideas, we propose two projection-based algorithms to solve a monotone inclusion problem in infinite dimensional Hilbert spaces. Solution theorems of strong convergence are obtained under the certain conditions. Some numerical experiments are presented to illustrate that our algorithms are efficient than the existing results.\n
\n\n\n
\n\n\n
\n \n\n \n \n Tan, B.; Zhou, Z.; and Li, S.\n\n\n \n \n \n Strong convergence of modified inertial mann algorithms for nonexpansive mappings.\n \n \n\n\n \n\n\n\n Mathematics, 8(4): 462. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"StrongPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{TZL_MATH20,\nauthor={Tan, Bing and Zhou, Zheng and Li, Songxiao},\ntitle={Strong convergence of modified inertial mann algorithms for nonexpansive mappings},\njournal={Mathematics},\nyear={2020},\nvolume={8},\nnumber={4},\ndoi={10.3390/math8040462},\npages={462},\nurl={https://bingtan.me/files/paper/TZL-Math2020.pdf},\nabstract={We investigated two new modified inertial Mann Halpern and inertial Mann viscosity algorithms for solving fixed point problems. Strong convergence theorems under some fewer restricted conditions are established in the framework of infinite dimensional Hilbert spaces. Finally, some numerical examples are provided to support our main results. The algorithms and results presented in this paper can generalize and extend corresponding results previously known in the literature.},\nkeywords={Halpern method,  Inertial method,  Nonexpansive mapping,  Strong convergence,  Viscosity method},\nabbrev_source_title={Mathematics},\n}\n\n
\n
\n\n\n
\n We investigated two new modified inertial Mann Halpern and inertial Mann viscosity algorithms for solving fixed point problems. Strong convergence theorems under some fewer restricted conditions are established in the framework of infinite dimensional Hilbert spaces. Finally, some numerical examples are provided to support our main results. The algorithms and results presented in this paper can generalize and extend corresponding results previously known in the literature.\n
\n\n\n
\n\n\n
\n \n\n \n \n Zhou, Z.; Tan, B.; and Li, S.\n\n\n \n \n \n A new accelerated self-adaptive stepsize algorithm with excellent stability for split common fixed point problems.\n \n \n\n\n \n\n\n\n Computational and Applied Mathematics, 39(3): 220. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{ZTL_COAM20,\nauthor={Zhou, Zheng and Tan, Bing and Li, Songxiao},\ntitle={A new accelerated self-adaptive stepsize algorithm with excellent stability for split common fixed point problems},\njournal={Computational and Applied Mathematics},\nyear={2020},\nvolume={39},\nnumber={3},\ndoi={10.1007/s40314-020-01237-0},\npages={220},\nurl={https://bingtan.me/files/paper/ZTL-COAM2020.pdf},\nabstract={In the framework of Hilbert spaces, we study the solutions of split common fixed point problems. A new accelerated self-adaptive stepsize algorithm with excellent stability is proposed under the effects of inertial techniques and Meir–Keeler contraction mappings. The strong convergence theorems are obtained without prior knowledge of operator norms. Finally, in applications, our main results in this paper are applied to signal recovery problems.},\nkeywords={Inertial method,  Meir–Keeler contraction,  Adaptive stepsize,  Signal processing problem, Split common fixed point problem},\nabbrev_source_title={Comput. Appl. Math.},\n}\n\n
\n
\n\n\n
\n In the framework of Hilbert spaces, we study the solutions of split common fixed point problems. A new accelerated self-adaptive stepsize algorithm with excellent stability is proposed under the effects of inertial techniques and Meir–Keeler contraction mappings. The strong convergence theorems are obtained without prior knowledge of operator norms. Finally, in applications, our main results in this paper are applied to signal recovery problems.\n
\n\n\n
\n\n\n
\n \n\n \n \n Zhou, Z.; Tan, B.; and Li, S.\n\n\n \n \n \n An inertial shrinking projection algorithm for split common fixed point problems.\n \n \n\n\n \n\n\n\n Journal of Applied Analysis and Computation, 10(5): 2104–2120. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@ARTICLE{ZTL_JAAC20,\nauthor={Zhou, Zheng and Tan, Bing and Li, Songxiao},\ntitle={An inertial shrinking projection algorithm for split common fixed point problems},\njournal={Journal of Applied Analysis and Computation},\nyear={2020},\nvolume={10},\nnumber={5},\npages={2104--2120},\ndoi={10.11948/20190330},\nurl={https://bingtan.me/files/paper/ZTL-JAAC2020.pdf},\nabstract={In this paper, the purpose is to introduce and study a new modified shrinking projection algorithm with inertial effects, which solves split common fixed point problems in Banach spaces. The corresponding strong convergence theorems are obtained without the assumption of semi-compactness on map-pings. Finally, some numerical examples are presented to illustrate the results in this paper.},\nkeywords={Inertial method,  Shrinking projection method,  Split common fixed point problem,  Strong convergence},\nabbrev_source_title={J. Appl. Anal. Comput.},\n}\n\n
\n
\n\n\n
\n In this paper, the purpose is to introduce and study a new modified shrinking projection algorithm with inertial effects, which solves split common fixed point problems in Banach spaces. The corresponding strong convergence theorems are obtained without the assumption of semi-compactness on map-pings. Finally, some numerical examples are presented to illustrate the results in this paper.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);