Zhi Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Zhi Zhao has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Teng-Teng Yao
Department of Mathematics, School of Sciences, Zhejiang University of Science and Technology, Hangzhou, People’s Republic of China
8 shared publications - Xiao-Qing Jin
Department of Mathematics, University of Macau, Macao, People’s Republic of China
6 shared publications - Zheng-Jian Bai
School of Mathematical Sciences, Xiamen University, Xiamen, People’s Republic of China
4 shared publications Xiao-Qing Jin
Univ Macau, Dept Math, Macau 999078, Peoples R China
2 shared publications- Xiao-Qing Jin
Department of Mathematics, University of Macau, Macao, People’s Republic of China
2 shared publications - Fu-Rong Lin
Department of Mathematics, Shantou University, Shantou, China
1 shared publication
Latest Publications
- 31 October 2025
- Published by Springer Nature in Numerical Algorithms
- Vol. 103 (2) , 1-41
Convergence properties of a new projection algorithm for pseudomonotone vector fields on hadamard manifolds
- 31 October 2025
- Published by Springer Nature in Numerical Algorithms
- Vol. 103 (2) , 1-41
Convergence properties of a new projection algorithm for pseudomonotone vector fields on hadamard manifolds
- 1 January 2023
- Published by Global Science Press in Numerical Mathematics: Theory, Methods and Applications
- Vol. 16 (4) , 954-967
A Riemannian Inertial Mann Algorithm for Nonexpansive Mappings on Hadamard Manifolds
The problem of finding fixed points of nonexpansive mappings on Hadamard manifolds is considered in this paper. To solve this kind of problem, we propose a modified Riemannian Mann algorithm with inertial effect. Under the assumption of existence of fixed points of the nonexpansive mapping, the global convergence of the proposed algorithm is established. To show the efficiency of the proposed algorithm, numerical comparisons with some existing algorithms are reported. COPYRIGHT: © Global Science Press
- 1 January 2023
- Published by Global Science Press in Numerical Mathematics: Theory, Methods and Applications
- Vol. 16 (4) , 954-967
A Riemannian Inertial Mann Algorithm for Nonexpansive Mappings on Hadamard Manifolds
The problem of finding fixed points of nonexpansive mappings on Hadamard manifolds is considered in this paper. To solve this kind of problem, we propose a modified Riemannian Mann algorithm with inertial effect. Under the assumption of existence of fixed points of the nonexpansive mapping, the global convergence of the proposed algorithm is established. To show the efficiency of the proposed algorithm, numerical comparisons with some existing algorithms are reported. COPYRIGHT: © Global Science Press
- 2 December 2022
- Published by Springer Nature in Numerical Algorithms
- Vol. 93 (3) , 1209-1223
A projection algorithm for pseudomonotone vector fields with convex constraints on Hadamard manifolds
- 2 December 2022
- Published by Springer Nature in Numerical Algorithms
- Vol. 93 (3) , 1209-1223
A projection algorithm for pseudomonotone vector fields with convex constraints on Hadamard manifolds
- 4 August 2022
- Published by Springer Nature in Numerical Algorithms
- Vol. 92 (3) , 1951-1981
A Riemannian inexact Newton dogleg method for constructing a symmetric nonnegative matrix with prescribed spectrum
- 4 August 2022
- Published by Springer Nature in Numerical Algorithms
- Vol. 92 (3) , 1951-1981
A Riemannian inexact Newton dogleg method for constructing a symmetric nonnegative matrix with prescribed spectrum
- 28 April 2021
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 62 (1) , 311-337
A Riemannian under-determined BFGS method for least squares inverse eigenvalue problems
- 28 April 2021
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 62 (1) , 311-337
A Riemannian under-determined BFGS method for least squares inverse eigenvalue problems
- 14 April 2021
- Published by Taylor & Francis in Optimization
- Vol. 71 (13) , 3797-3817
A modified Riemannian Halpern algorithm for nonexpansive mappings on Hadamard manifolds
In this paper, we are concerned with the problem of finding fixed points of nonexpansive mappings on Hadamard manifolds. To solving this kind of problem, a modified Riemannian Halpern algorithm, which is a natural generalization of a modified Halpern algorithm in Euclidean space is proposed. By giving some mild assumptions and necessary lemmas, the global convergence of the proposed algorithm is established. Finally, when the problem is solved in the framework of Hadamard manifolds, the numerical experiments show the effectiveness of the proposed algorithm, especially in computational time and number of iterations.
- 14 April 2021
- Published by Taylor & Francis in Optimization
- Vol. 71 (13) , 3797-3817
A modified Riemannian Halpern algorithm for nonexpansive mappings on Hadamard manifolds
In this paper, we are concerned with the problem of finding fixed points of nonexpansive mappings on Hadamard manifolds. To solving this kind of problem, a modified Riemannian Halpern algorithm, which is a natural generalization of a modified Halpern algorithm in Euclidean space is proposed. By giving some mild assumptions and necessary lemmas, the global convergence of the proposed algorithm is established. Finally, when the problem is solved in the framework of Hadamard manifolds, the numerical experiments show the effectiveness of the proposed algorithm, especially in computational time and number of iterations.
- 25 February 2020
- Published by Springer Nature in Numerical Algorithms
- Vol. 86 (1) , 325-355
A Riemannian derivative-free Polak–Ribiére–Polyak method for tangent vector field
- 25 February 2020
- Published by Springer Nature in Numerical Algorithms
- Vol. 86 (1) , 325-355
A Riemannian derivative-free Polak–Ribiére–Polyak method for tangent vector field
- Open Access
A Riemannian Derivative-Free Polak-Ribiere-Polyak Method for Tangent Vector Field
This paper is concerned with the problem of finding a zero of a tangent vector field on a Riemannian manifold. We first reformulate the problem as an equivalent Riemannian optimization problem. Then we propose a Riemannian derivative-free Polak-Ribi\'ere-Polyak method for solving the Riemannian optimization problem, where a non-monotone line search is employed. The global convergence of the proposed method is established under some mild assumptions. To further improve the efficiency, we also provide a hybrid method, which combines the proposed geometric method with the Riemannian Newton method. Finally, some numerical experiments are reported to illustrate the efficiency of the proposed method.
Open AccessA Riemannian Derivative-Free Polak-Ribiere-Polyak Method for Tangent Vector Field
This paper is concerned with the problem of finding a zero of a tangent vector field on a Riemannian manifold. We first reformulate the problem as an equivalent Riemannian optimization problem. Then we propose a Riemannian derivative-free Polak-Ribi\'ere-Polyak method for solving the Riemannian optimization problem, where a non-monotone line search is employed. The global convergence of the proposed method is established under some mild assumptions. To further improve the efficiency, we also provide a hybrid method, which combines the proposed geometric method with the Riemannian Newton method. Finally, some numerical experiments are reported to illustrate the efficiency of the proposed method.
- Open Access
A Preconditioned Riemannian Gauss-Newton Method for Least Squares Inverse Eigenvalue Problems
This paper is concerned with the least squares inverse eigenvalue problem of reconstructing a linear parameterized real symmetric matrix from the prescribed partial eigenvalues in the sense of least squares, which was originally proposed by Chen and Chu [SIAM J. Numer. Anal., 33 (1996), pp. 2417--2430]. We provide a Riemannian inexact Gausss-Newton method for solving the least squares inverse eigenvalue problem. The global and local convergence analysis of the proposed method is discussed. Also, a preconditioned conjugate gradient method with an efficient preconditioner is proposed for solving the Riemannian Gauss-Newton equation. Finally, some numerical tests, including an application in the inverse Sturm-Liouville problem, are reported to illustrate the efficiency of the proposed method.
Open AccessA Preconditioned Riemannian Gauss-Newton Method for Least Squares Inverse Eigenvalue Problems
This paper is concerned with the least squares inverse eigenvalue problem of reconstructing a linear parameterized real symmetric matrix from the prescribed partial eigenvalues in the sense of least squares, which was originally proposed by Chen and Chu [SIAM J. Numer. Anal., 33 (1996), pp. 2417--2430]. We provide a Riemannian inexact Gausss-Newton method for solving the least squares inverse eigenvalue problem. The global and local convergence analysis of the proposed method is discussed. Also, a preconditioned conjugate gradient method with an efficient preconditioner is proposed for solving the Riemannian Gauss-Newton equation. Finally, some numerical tests, including an application in the inverse Sturm-Liouville problem, are reported to illustrate the efficiency of the proposed method.
- 1 January 2017
- Published by Global Science Press in East Asian Journal on Applied Mathematics
- Vol. 7 (4) , 827-836
A Convergence Analysis of the MINRES Method for Some Hermitian Indefinite Systems
A Convergence Analysis of the MINRES Method for Some Hermitian Indefinite Systems - Volume 7 Issue 4 - Ze-Jia Xie, Xiao-Qing Jin, Zhi Zhao
- 1 January 2017
- Published by Global Science Press in East Asian Journal on Applied Mathematics
- Vol. 7 (4) , 827-836
A Convergence Analysis of the MINRES Method for Some Hermitian Indefinite Systems
A Convergence Analysis of the MINRES Method for Some Hermitian Indefinite Systems - Volume 7 Issue 4 - Ze-Jia Xie, Xiao-Qing Jin, Zhi Zhao