Pengjie 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
Pengjie Liu has a total of 79 co-authors. Here are the top co-authors by number of shared publications:
- Hu Shao
School of Mathematics, China University of Mining and Technology, Xuzhou, China
17 shared publications - Jinbao Jian
School of Mathematical Sciences & Center for Applied Mathematics of Guangxi, Guangxi Minzu University, Nanning, China
10 shared publications - Xianzhen Jiang
School of Mathematical Sciences, Center for Applied Mathematics, Guangxi Minzu University, Nanning, China
7 shared publications - Xiaoyu Wu
School of Mathematics, China University of Mining and Technology, Xuzhou, China
6 shared publications - Bohan Li
School of Mathematics, China University of Mining and Technology, Xuzhou, China
3 shared publications Feng Shao
3 shared publications
Latest Publications
- 13 November 2026
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 164
Two extended conjugate gradient methods with adaptive restart for unconstrained optimization
- 13 November 2026
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 164
Two extended conjugate gradient methods with adaptive restart for unconstrained optimization
- 1 January 2026
- Published by Springer Nature in Numerical Algorithms
- Vol. 103 (3) , 1967-2003
A modified spectral three-term hybrid derivative-free projection method using convex combination acceleration to solve nonlinear complementarity problems
- 1 January 2026
- Published by Springer Nature in Numerical Algorithms
- Vol. 103 (3) , 1967-2003
A modified spectral three-term hybrid derivative-free projection method using convex combination acceleration to solve nonlinear complementarity problems
- 17 December 2025
- Published by Springer Nature in Optimization Letters
- Vol. 20 (4) , 841-872
An accelerated hybrid three-term derivative-free projection method with applications
- 17 December 2025
- Published by Springer Nature in Optimization Letters
- Vol. 20 (4) , 841-872
An accelerated hybrid three-term derivative-free projection method with applications
- 6 October 2025
- Published by Taylor & Francis in Transportation Letters
- Vol. 18 (3) , 463-480
An inertia-infused ADMM-based splitting algorithm with parallel computing for traffic assignment
- 6 October 2025
- Published by Taylor & Francis in Transportation Letters
- Vol. 18 (3) , 463-480
An inertia-infused ADMM-based splitting algorithm with parallel computing for traffic assignment
- 25 September 2025
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 32 (5)
An Accelerated Spectral CG‐Type Projection Method With Restart Strategy for Nonlinear Monotone Equations and Applications in Compressed Sensing
In this study, we present an accelerated spectral conjugate gradient‐type projection method to solve the system of nonlinear monotone equations. Compared to traditional methods for solving such equations, this method utilizes three‐step successive information to produce inertial iterates. The proposed composite search direction framework incorporates an effective restart strategy, eliminating the need for additional conditions, including the specification of conjugate parameter, and satisfies conditions for the sufficient descent condition and trust region property. Establishing the theoretical convergence of the present method does not require Lipschitz continuity. Furthermore, we analyze the asymptotic and non‐asymptotic convergence rates in terms of iteration complexity. To evaluate effectiveness, comparative tests are conducted against existing methods using problems related to the system of nonlinear equations. Moreover, the practicality of the presented method is demonstrated through applications in compressed sensing.
- 25 September 2025
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 32 (5)
An Accelerated Spectral CG‐Type Projection Method With Restart Strategy for Nonlinear Monotone Equations and Applications in Compressed Sensing
In this study, we present an accelerated spectral conjugate gradient‐type projection method to solve the system of nonlinear monotone equations. Compared to traditional methods for solving such equations, this method utilizes three‐step successive information to produce inertial iterates. The proposed composite search direction framework incorporates an effective restart strategy, eliminating the need for additional conditions, including the specification of conjugate parameter, and satisfies conditions for the sufficient descent condition and trust region property. Establishing the theoretical convergence of the present method does not require Lipschitz continuity. Furthermore, we analyze the asymptotic and non‐asymptotic convergence rates in terms of iteration complexity. To evaluate effectiveness, comparative tests are conducted against existing methods using problems related to the system of nonlinear equations. Moreover, the practicality of the presented method is demonstrated through applications in compressed sensing.
- 25 September 2025
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 105 (2) , 1-31
An accelerated derivative-free memoryless Davidon-Fletcher-Powell method and its iteration-complexity analysis
- 25 September 2025
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 105 (2) , 1-31
An accelerated derivative-free memoryless Davidon-Fletcher-Powell method and its iteration-complexity analysis
- 15 August 2025
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 41 (8) , 2160-2194
A Half-Proximal Symmetric Splitting Method for Non-Convex Separable Optimization
- 15 August 2025
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 41 (8) , 2160-2194
A Half-Proximal Symmetric Splitting Method for Non-Convex Separable Optimization
- 24 July 2025
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 71 (S2) , 1761-1802
Improved Fletcher–Reeves and Dai–Yuan conjugate gradient methods with an efficient restart mechanism and their iterative complexity guarantees
- 24 July 2025
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 71 (S2) , 1761-1802
Improved Fletcher–Reeves and Dai–Yuan conjugate gradient methods with an efficient restart mechanism and their iterative complexity guarantees
- 17 June 2025
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 71 (5) , 6251-6288
Two adaptive restarting improved conjugate gradient methods with iterative complexity guarantees
- 17 June 2025
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 71 (5) , 6251-6288
Two adaptive restarting improved conjugate gradient methods with iterative complexity guarantees