Hongwei Liu
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
Hongwei Liu has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Zexian Liu
School of Mathematics and Statistics, GuiZhou University, Guiyang, China
10 shared publications - Changhe Liu
School of Mathematics and Statistics, Henan University of Science and Technology, Luoyang, China
3 shared publications - Xiao Liang Dong
Xidian University
3 shared publications - Feng Ye
School of Science, Xidian University, No. 2, Taibai Road, Xi’an, Shaanxi 710071, China
2 shared publications - Jun Yang
School of Mathematics and Statistics, Xianyang Normal University, Xianyang, China
2 shared publications - Shanxue Yang
School of Mathematics and Statistics, XiDian University, Xi’an, China
2 shared publications
Latest Publications
- 2 July 2024
- Published by Springer Nature in Optimization Letters
- Vol. 19 (4) , 717-745
A limited memory subspace minimization conjugate gradient algorithm for unconstrained optimization
- 2 July 2024
- Published by Springer Nature in Optimization Letters
- Vol. 19 (4) , 717-745
A limited memory subspace minimization conjugate gradient algorithm for unconstrained optimization
- 3 December 2023
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 200 (2) , 820-851
A New Subspace Minimization Conjugate Gradient Method for Unconstrained Minimization
- 3 December 2023
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 200 (2) , 820-851
A New Subspace Minimization Conjugate Gradient Method for Unconstrained Minimization
- Open Access
A new subspace minimization conjugate gradient method for unconstrained minimization
Subspace minimization conjugate gradient (SMCG) methods have become a class of quite efficient iterative methods for unconstrained optimization and have attracted extensive attention recently. Usually, the search directions of SMCG methods are generated by minimizing approximate models with the approximation matrix $ B_k $ of the objective function at the current iterate over the subspace spanned by the current gradient $ g_k $ and the latest search direction. The $ g_k^TB_kg_k $ must be estimated properly in the calculation of the search directions, which is crucial to the theoretical properties and the numerical performance of SMCG methods. It is a great challenge to estimate it properly. The projection technique has been used successfully to generate conjugate gradient directions such as Dai-Kou conjugate gradient direction. Motivated by the above two observations, in the paper we present a new subspace minimization conjugate gradient methods by using a projection technique based on the memoryless quasi-Newton method. More specially, we project the search direction of the memoryless quasi-Newton method into the subspace spanned by the current gradient and the latest search direction and drive a new search direction, which is proved to be descent. Remarkably, the proposed method without any line search enjoys the finite termination property for two dimensional convex quadratic functions, which is helpful for designing algorithm. An adaptive scaling factor in the search direction is given based on the above finite termination property. The proposed method does not need to determine the parameter $ ρ_k $ and can be regarded as an extension of Dai-Kou conjugate gradient method. The global convergence of the proposed method is analyzed. Numerical comparisons indicate the proposed method is very promising.Open AccessA new subspace minimization conjugate gradient method for unconstrained minimization
Subspace minimization conjugate gradient (SMCG) methods have become a class of quite efficient iterative methods for unconstrained optimization and have attracted extensive attention recently. Usually, the search directions of SMCG methods are generated by minimizing approximate models with the approximation matrix $ B_k $ of the objective function at the current iterate over the subspace spanned by the current gradient $ g_k $ and the latest search direction. The $ g_k^TB_kg_k $ must be estimated properly in the calculation of the search directions, which is crucial to the theoretical properties and the numerical performance of SMCG methods. It is a great challenge to estimate it properly. The projection technique has been used successfully to generate conjugate gradient directions such as Dai-Kou conjugate gradient direction. Motivated by the above two observations, in the paper we present a new subspace minimization conjugate gradient methods by using a projection technique based on the memoryless quasi-Newton method. More specially, we project the search direction of the memoryless quasi-Newton method into the subspace spanned by the current gradient and the latest search direction and drive a new search direction, which is proved to be descent. Remarkably, the proposed method without any line search enjoys the finite termination property for two dimensional convex quadratic functions, which is helpful for designing algorithm. An adaptive scaling factor in the search direction is given based on the above finite termination property. The proposed method does not need to determine the parameter $ ρ_k $ and can be regarded as an extension of Dai-Kou conjugate gradient method. The global convergence of the proposed method is analyzed. Numerical comparisons indicate the proposed method is very promising. - 13 April 2022
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 85 (2) , 1-41
Convergence Results of a New Monotone Inertial Forward–Backward Splitting Algorithm Under the Local Hölder Error Bound Condition
- 13 April 2022
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 85 (2) , 1-41
Convergence Results of a New Monotone Inertial Forward–Backward Splitting Algorithm Under the Local Hölder Error Bound Condition
- 4 November 2020
- Published by Global Science Press in Journal of Computational Mathematics
- Vol. 39 (2) , 159-177
A New Adaptive Subspace Minimization Three-Term Conjugate Gradient Algorithm for Unconstrained Optimization
A new adaptive subspace minimization three-term conjugate gradient algorithm with nonmonotone line search is introduced and analyzed in this paper. The search directions are computed by minimizing a quadratic approximation of the objective function on special subspaces, and we also proposed an adaptive rule for choosing different searching directions at each iteration. We obtain a significant conclusion that the each choice of the search directions satisfies the sufficient descent condition. With the used nonmonotone line search, we prove that the new algorithm is globally convergent for general nonlinear functions under some mild assumptions. Numerical experiments show that the proposed algorithm is promising for the given test problem set.
- 4 November 2020
- Published by Global Science Press in Journal of Computational Mathematics
- Vol. 39 (2) , 159-177
A New Adaptive Subspace Minimization Three-Term Conjugate Gradient Algorithm for Unconstrained Optimization
A new adaptive subspace minimization three-term conjugate gradient algorithm with nonmonotone line search is introduced and analyzed in this paper. The search directions are computed by minimizing a quadratic approximation of the objective function on special subspaces, and we also proposed an adaptive rule for choosing different searching directions at each iteration. We obtain a significant conclusion that the each choice of the search directions satisfies the sufficient descent condition. With the used nonmonotone line search, we prove that the new algorithm is globally convergent for general nonlinear functions under some mild assumptions. Numerical experiments show that the proposed algorithm is promising for the given test problem set.
- Top Cited Papers
- 7 August 2020
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 77 (2) , 491-508
Weak convergence of iterative methods for solving quasimonotone variational inequalities
- 7 August 2020
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 77 (2) , 491-508
Top Cited PapersWeak convergence of iterative methods for solving quasimonotone variational inequalities
- 21 December 2019
- Published by Springer Nature in Evolutionary Intelligence
- Vol. 16 (6) , 1779-1788
Reducing the number of function evaluations in derivative-free algorithm for bound constrained optimization
- 21 December 2019
- Published by Springer Nature in Evolutionary Intelligence
- Vol. 16 (6) , 1779-1788
Reducing the number of function evaluations in derivative-free algorithm for bound constrained optimization
- 23 November 2019
- Published by Springer Nature in Evolutionary Intelligence
- Vol. 17 (1) , 11-20
An efficient derivative-free algorithm for bound constrained mixed-integer optimization
- 23 November 2019
- Published by Springer Nature in Evolutionary Intelligence
- Vol. 17 (1) , 11-20
An efficient derivative-free algorithm for bound constrained mixed-integer optimization
- 2 November 2019
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 75 (1) , 145-167
An improved Dai–Kou conjugate gradient algorithm for unconstrained optimization
- 2 November 2019
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 75 (1) , 145-167
An improved Dai–Kou conjugate gradient algorithm for unconstrained optimization