Jinbao Jian

Jinbao Jian


Research Focus & Metrics

Academic Career Length

30Years (1997-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 January 2021 in Numerical Algorithms
Verified
Journal Article
Closed access
PDF file
JYJianghua Yin
Jianghua Yin
JJJinbao Jian
Jinbao Jian
XJXianzhen Jiang
Xianzhen Jiang
MLMeixing Liu
Meixing Liu
LWLingzhi Wang
Lingzhi Wang

14 July 2022 in Numerical Algorithms
Verified
Journal Article
Closed access
PDF file
GMGuodong Ma
Guodong Ma
JJJiachen Jin
Jiachen Jin
JJJinbao Jian
Jinbao Jian
JYJianghua Yin
Jianghua Yin
DHDaolan Han
Daolan Han

13 March 2022 in Numerical Algorithms
Verified
Journal Article
Closed access
PDF file
XJXianzhen Jiang
Xianzhen Jiang
WLWei Liao
Wei Liao
JYJianghua Yin
Jianghua Yin
JJJinbao Jian
Jinbao Jian

1 March 2019 in Journal of Computational and Applied Mathematics
Verified
Journal Article
Closed access
XJXianzhen Jiang
Xianzhen Jiang
JJJinbao Jian
Jinbao Jian

5 August 2016 in Optimization Methods and Software
Verified
Journal Article
Closed access
JJJinbao Jian
Jinbao Jian
QCQian Chen
Qian Chen
XJXianzhen Jiang
Xianzhen Jiang
YZYoufang Zeng
Youfang Zeng
JYJianghua Yin
Jianghua Yin
The spectral conjugate gradient methods, with simple construction and nice numerical performance, are a kind of effective methods for solving large-scale unconstrained optimization problems. In this paper, based on quasi-Newton direction and quasi-Newton condition, and motivated by the idea of spectral conjugate gradient method as well as Dai-Kou's selecting technique for conjugate parameter [SIAM J. Optim. 23 (2013), pp. 296–320], a new approach for generating spectral parameters is presented, where a new double-truncating technique, which can ensure both the sufficient descent property of the search directions and the bounded property of the sequence of spectral parameters, is introduced. Then a new associated spectral conjugate gradient method for large-scale unconstrained optimization is proposed. Under either the strong Wolfe line search or the generalized Wolfe line search, the proposed method is always globally convergent. Finally, a large number of comparison numerical experiments on large-scale instances from one thousand to two million variables are reported. The numerical results show that the proposed method is more promising.

31 July 2023 in Computational Optimization and Applications
Verified
Journal Article
Closed access
PDF file
JYJianghua Yin
Jianghua Yin
JJJinbao Jian
Jinbao Jian
GMGuodong Ma
Guodong Ma