Yu-Tao Zheng
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
Yu-Tao Zheng has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Lu-Bin Cui
School of Mathematics and Statistics, Henan Normal University, Xinxiang 453007, China
2 shared publications Bing Zheng
School of Mathematics and Statistics Lanzhou University 730000 Lanzhou P.R. China
1 shared publication- Xiao-Qing Zhang
School of Mathematics and Information Sciences, Henan Normal University, Xinxiang, People’s Republic of China
1 shared publication - Yu-Dong Fan
Henan Engineering Laboratory for Big Data Statistical Analysis and Optimal Control, School of Mathematics and Information Sciences, Henan Normal University, Xinxiang, China
1 shared publication
Latest Publications
- 26 December 2021
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 41 (1) , 1-17
A general preconditioner accelerated SOR-type iterative method for multi-linear systems with ${\mathcal {Z}}$-tensors- 26 December 2021
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 41 (1) , 1-17
A general preconditioner accelerated SOR-type iterative method for multi-linear systems with ${\mathcal {Z}}$-tensors- Open Access
- 15 November 2021
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 55 (6) , 3281-3291
A new family of Dai-Liao conjugate gradient methods with modified secant equation for unconstrained optimization
In this paper, a new family of Dai-Liao–type conjugate gradient methods are proposed for unconstrained optimization problem. In the new methods, the modified secant equation used in [H. Yabe and M. Takano, Comput. Optim. Appl. 28 (2004) 203–225] is considered in Dai and Liao’s conjugacy condition. Under some certain assumptions, we show that our methods are globally convergent for general functions with strong Wolfe line search. Numerical results illustrate that our proposed methods can outperform some existing ones.
- 15 November 2021
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 55 (6) , 3281-3291
Open AccessA new family of Dai-Liao conjugate gradient methods with modified secant equation for unconstrained optimization
In this paper, a new family of Dai-Liao–type conjugate gradient methods are proposed for unconstrained optimization problem. In the new methods, the modified secant equation used in [H. Yabe and M. Takano, Comput. Optim. Appl. 28 (2004) 203–225] is considered in Dai and Liao’s conjugacy condition. Under some certain assumptions, we show that our methods are globally convergent for general functions with strong Wolfe line search. Numerical results illustrate that our proposed methods can outperform some existing ones.
- 5 May 2021
- Published by Springer Nature in Japan Journal of Industrial and Applied Mathematics
- Vol. 38 (3) , 965-978
A preconditioner based on a splitting-type iteration method for solving complex symmetric indefinite linear systems
- 5 May 2021
- Published by Springer Nature in Japan Journal of Industrial and Applied Mathematics
- Vol. 38 (3) , 965-978
A preconditioner based on a splitting-type iteration method for solving complex symmetric indefinite linear systems
- Open Access
A modified adaptive cubic regularization method for large-scale unconstrained optimization problem
In this paper, we modify the adaptive cubic regularization method for large-scale unconstrained optimization problem by using a real positive definite scalar matrix to approximate the exact Hessian. Combining with the nonmonotone technique, we also give a variant of the modified algorithm. Under some reasonable conditions, we analyze the global convergence of the proposed methods. Numerical experiments are performed and the obtained results show satisfactory performance when compared to the standard trust region method, adaptive regularization algorithm with cubics and the simple model trust-region method.
Open AccessA modified adaptive cubic regularization method for large-scale unconstrained optimization problem
In this paper, we modify the adaptive cubic regularization method for large-scale unconstrained optimization problem by using a real positive definite scalar matrix to approximate the exact Hessian. Combining with the nonmonotone technique, we also give a variant of the modified algorithm. Under some reasonable conditions, we analyze the global convergence of the proposed methods. Numerical experiments are performed and the obtained results show satisfactory performance when compared to the standard trust region method, adaptive regularization algorithm with cubics and the simple model trust-region method.