Zexian 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
Zexian Liu has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
Hongwei Liu
School of Mathematics and Statistics, Xidian University, Xi'an, People's Republic of China
10 shared publications- Hongwei Liu
School of Mathematics and Statistics, XiDian University, Xi’an, China
10 shared publications - Hongwei Liu
School of Mathematics and Statistics, XiDian University, Xi’an, China
10 shared publications - Wumei Sun
School of science, Xi’an University of Science and Technology, Xi’an, China
7 shared publications Keke Zhang
School of Mathematics and Statistics, Xidian University, Xi’an 710126, China
2 shared publicationsMing Li
School of Mathematics and Statistics, Xidian University, 710126, Xi'an, China
2 shared publications
Latest Publications
- 20 November 2025
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 93 (3) , 1069-1105
Multi-objective k-way parallel hypergraph partitioning with proximal gradient algorithm
- 20 November 2025
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 93 (3) , 1069-1105
Multi-objective k-way parallel hypergraph partitioning with proximal gradient algorithm
- 27 September 2025
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 152
New primal-dual algorithm for convex-concave saddle point problems
- 27 September 2025
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 152
New primal-dual algorithm for convex-concave saddle point problems
- Open Access
New Primal-Dual Algorithm for Convex Problems
Primal-dual algorithm (PDA) is a classic and popular scheme for convex-concave saddle point problems. It is universally acknowledged that the proximal terms in the subproblems about the primal and dual variables are crucial to the convergence theory and numerical performance of primal-dual algorithms. By taking advantage of the information from the current and previous iterative points, we exploit two new proximal terms for the subproblems about the primal and dual variables. Based on two new proximal terms, we present a new primal-dual algorithm for convex-concave saddle point problems with bilinear coupling terms and establish its global convergence and O(1/N ) ergodic convergence rate. When either the primal function or the dual function is strongly convex, we accelerate the above proposed algorithm and show that the corresponding algorithm can achieve O(1/N^2) convergence rate. Since the conditions for the stepsizes of the proposed algorithm are related directly to the spectral norm of the linear transform, which is difficult to obtain in some applications, we also introduce a linesearch strategy for the above proposed primal-dual algorithm and establish its global convergence and O(1/N ) ergodic convergence rate . Some numerical experiments are conducted on matrix game and LASSO problems by comparing with other state-of-the-art algorithms, which demonstrate the effectiveness of the proposed three primal-dual algorithms.
Open AccessNew Primal-Dual Algorithm for Convex Problems
Primal-dual algorithm (PDA) is a classic and popular scheme for convex-concave saddle point problems. It is universally acknowledged that the proximal terms in the subproblems about the primal and dual variables are crucial to the convergence theory and numerical performance of primal-dual algorithms. By taking advantage of the information from the current and previous iterative points, we exploit two new proximal terms for the subproblems about the primal and dual variables. Based on two new proximal terms, we present a new primal-dual algorithm for convex-concave saddle point problems with bilinear coupling terms and establish its global convergence and O(1/N ) ergodic convergence rate. When either the primal function or the dual function is strongly convex, we accelerate the above proposed algorithm and show that the corresponding algorithm can achieve O(1/N^2) convergence rate. Since the conditions for the stepsizes of the proposed algorithm are related directly to the spectral norm of the linear transform, which is difficult to obtain in some applications, we also introduce a linesearch strategy for the above proposed primal-dual algorithm and establish its global convergence and O(1/N ) ergodic convergence rate . Some numerical experiments are conducted on matrix game and LASSO problems by comparing with other state-of-the-art algorithms, which demonstrate the effectiveness of the proposed three primal-dual algorithms.
- 1 January 2025
- Published by Chongqing Normal University in Pacific Journal of Optimization
- p. 47
An efficient inertial subspace minimization conjugate gradient method based on regularization model with convergence rate analysis for constrained nonlinear equations
(Communicated by Fanwen Meng) Subspace minimization conjugate gradient (SMCG) methods are highly efficient iterative schemes for unconstrained optimization and have garnered increasing attention recently. The inertial step strategy is often utilized to speed up iterative methods. By taking advantage of the information at the recent three iterations further, we exploit a new adaptive inertial step strategy. We design a new update form for regularization parameter, and extend the search direction in the SMCG method based on regularization model to the solution of constrained nonlinear equations by incorporating the resulting adaptive inertial step strategy. Based on the resulting search direction and the projection technique, we present an efficient inertial SMCG method based on regularization model for solving constrained nonlinear monotone equations, where the search direction satisfies the sufficient descent property and the trust region property independent of any line search. The global convergence and improved convergence rate of the proposed method are established under the assumptions without imposing the Lipschitz continuity on the underlying mapping. Numerical experiments demonstrate that the proposed method is very promising.
- 1 January 2025
- Published by Chongqing Normal University in Pacific Journal of Optimization
- p. 47
An efficient inertial subspace minimization conjugate gradient method based on regularization model with convergence rate analysis for constrained nonlinear equations
(Communicated by Fanwen Meng) Subspace minimization conjugate gradient (SMCG) methods are highly efficient iterative schemes for unconstrained optimization and have garnered increasing attention recently. The inertial step strategy is often utilized to speed up iterative methods. By taking advantage of the information at the recent three iterations further, we exploit a new adaptive inertial step strategy. We design a new update form for regularization parameter, and extend the search direction in the SMCG method based on regularization model to the solution of constrained nonlinear equations by incorporating the resulting adaptive inertial step strategy. Based on the resulting search direction and the projection technique, we present an efficient inertial SMCG method based on regularization model for solving constrained nonlinear monotone equations, where the search direction satisfies the sufficient descent property and the trust region property independent of any line search. The global convergence and improved convergence rate of the proposed method are established under the assumptions without imposing the Lipschitz continuity on the underlying mapping. Numerical experiments demonstrate that the proposed method is very promising.
- Open Access
- 20 December 2024
- Published by Science China Press., Co. Ltd. in SCIENTIA SINICA Mathematica
- Vol. 55 (2) , 427
Advances in nonlinear conjugate gradient methods
共轭梯度法具有迭代简单、所需存储量少和数值效果好等优点, 是求解大规模无约束优化问题极具竞争力的方法. 首先介绍非线性共轭梯度法的收敛理论及其进展; 然后将非线性共轭梯度法分为早期的共轭梯度法、下降的共轭梯度法和充分下降的共轭梯度法, 逐一介绍其理论与算法的最新进展, 并讨论共轭梯度法的杂交策略和重启策略; 最后介绍Dai-Liao共轭梯度法和其他共轭梯度法的算法进展和研究前沿.
- 20 December 2024
- Published by Science China Press., Co. Ltd. in SCIENTIA SINICA Mathematica
- Vol. 55 (2) , 427
Open AccessAdvances in nonlinear conjugate gradient methods
共轭梯度法具有迭代简单、所需存储量少和数值效果好等优点, 是求解大规模无约束优化问题极具竞争力的方法. 首先介绍非线性共轭梯度法的收敛理论及其进展; 然后将非线性共轭梯度法分为早期的共轭梯度法、下降的共轭梯度法和充分下降的共轭梯度法, 逐一介绍其理论与算法的最新进展, 并讨论共轭梯度法的杂交策略和重启策略; 最后介绍Dai-Liao共轭梯度法和其他共轭梯度法的算法进展和研究前沿.
- 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
- 2 April 2024
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- Vol. 45 (4-6) , 333-354
A New Dai-Liao Conjugate Gradient Method based on Approximately Optimal Stepsize for Unconstrained Optimization
- 2 April 2024
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- Vol. 45 (4-6) , 333-354
A New Dai-Liao Conjugate Gradient Method based on Approximately Optimal Stepsize for Unconstrained Optimization
- 5 March 2024
- Published by Springer Nature in Journal of Global Optimization
- Vol. 89 (4) , 863-897
A nonmonotone accelerated proximal gradient method with variable stepsize strategy for nonsmooth and nonconvex minimization problems
- 5 March 2024
- Published by Springer Nature in Journal of Global Optimization
- Vol. 89 (4) , 863-897
A nonmonotone accelerated proximal gradient method with variable stepsize strategy for nonsmooth and nonconvex minimization problems
- 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