Huiping Cao
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
Huiping Cao has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Jing Han
School of Computer Science and Mathematics, Central South University of Forestry and Technology, No. 498, Shaoshan South Road, Tian Xin District, Changsha 410013, China
2 shared publications Sanyang Liu
Xidian University
2 shared publications- Xiao-Min An
School of Science, Xi’an Technological University, Xi’an, China
2 shared publications Yuncheng Xu
Xidian University
2 shared publications- Jie Liu
Hebei Innovation Center for Equipment Lightweight Design and Manufacturing, School of Mechanical Engineering, Yanshan University, Qinhuangdao, China
1 shared publication - Linjun Wang
China Three Gorges University
1 shared publication
Latest Publications
- 16 October 2026
- Published by Taylor & Francis in Optimization
- p. 1-33
An adaptive descent BFGS method with fast Fourier transform for generalized Hankel tensor equations
1. Tensors, serving as a key tool for processing high-dimensional data and large-scale problems, play an increasingly important role in scientific computing and engineering [1–3]. In particular, Ha...
- 16 October 2026
- Published by Taylor & Francis in Optimization
- p. 1-33
An adaptive descent BFGS method with fast Fourier transform for generalized Hankel tensor equations
1. Tensors, serving as a key tool for processing high-dimensional data and large-scale problems, play an increasingly important role in scientific computing and engineering [1–3]. In particular, Ha...
- Open Access
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 22 (10) , 4978-5000
Modified limited-memory BFGS method with a cautious update for generalized semi-symmetric tensor equations
For the generalized semi-symmetric tensor equations, this paper reformulates the equations as a nonlinear least-squares problem and proposes a modified L-BFGS method with a cautious update. The method constructs a candidate modified curvature vector using high-order curvature information and employs a cautious criterion to select reliable curvature pairs. Under suitable assumptions, the global convergence of the proposed method is established with a Wolfe line search. Numerical experiments on semi-symmetric tensor test problems with positive and nonuniform coupling show that the proposed method exhibits good stability and competitive performance.
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 22 (10) , 4978-5000
Open AccessModified limited-memory BFGS method with a cautious update for generalized semi-symmetric tensor equations
For the generalized semi-symmetric tensor equations, this paper reformulates the equations as a nonlinear least-squares problem and proposes a modified L-BFGS method with a cautious update. The method constructs a candidate modified curvature vector using high-order curvature information and employs a cautious criterion to select reliable curvature pairs. Under suitable assumptions, the global convergence of the proposed method is established with a Wolfe line search. Numerical experiments on semi-symmetric tensor test problems with positive and nonuniform coupling show that the proposed method exhibits good stability and competitive performance.
- 14 April 2025
- Published by Springer Nature in Calcolo
- Vol. 62 (2) , 1-17
A diagonal quasi-Newton method based on automatic differentiation for nonlinear equations
- 14 April 2025
- Published by Springer Nature in Calcolo
- Vol. 62 (2) , 1-17
A diagonal quasi-Newton method based on automatic differentiation for nonlinear equations
- 16 November 2022
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 69 (2) , 1917-1944
Solving nonlinear equations with a direct Broyden method and its acceleration
- 16 November 2022
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 69 (2) , 1917-1944
Solving nonlinear equations with a direct Broyden method and its acceleration
- Open Access
A Class of Sparse Direct Broyden Method for Solving Sparse Nonlinear Equations
In our paper, we present a sparse quasi-Newton method, called the sparse direct Broyden method, for solving sparse nonlinear equations. The method can be seen as a Broyden-like method and is a least change update satisfying the sparsity condition and direct tangent condition simultaneously. The local and q-superlinear convergence is presented based on the bounded deterioration property and Dennis–Moré condition. By adopting a nonmonotone line search, we establish the global and superlinear convergence. Moreover, the unit step length is essentially accepted. Numerical results demonstrate that the sparse direct Broyden method is effective and competitive for large-scale nonlinear equations.
Open AccessA Class of Sparse Direct Broyden Method for Solving Sparse Nonlinear Equations
In our paper, we present a sparse quasi-Newton method, called the sparse direct Broyden method, for solving sparse nonlinear equations. The method can be seen as a Broyden-like method and is a least change update satisfying the sparsity condition and direct tangent condition simultaneously. The local and q-superlinear convergence is presented based on the bounded deterioration property and Dennis–Moré condition. By adopting a nonmonotone line search, we establish the global and superlinear convergence. Moreover, the unit step length is essentially accepted. Numerical results demonstrate that the sparse direct Broyden method is effective and competitive for large-scale nonlinear equations.
- Open Access
A Sparse Quasi-Newton Method Based on Automatic Differentiation for Solving Unconstrained Optimization Problems
In our paper, we introduce a sparse and symmetric matrix completion quasi-Newton model using automatic differentiation, for solving unconstrained optimization problems where the sparse structure of the Hessian is available. The proposed method is a kind of matrix completion quasi-Newton method and has some nice properties. Moreover, the presented method keeps the sparsity of the Hessian exactly and satisfies the quasi-Newton equation approximately. Under the usual assumptions, local and superlinear convergence are established. We tested the performance of the method, showing that the new method is effective and superior to matrix completion quasi-Newton updating with the Broyden–Fletcher–Goldfarb–Shanno (BFGS) method and the limited-memory BFGS method.
Open AccessA Sparse Quasi-Newton Method Based on Automatic Differentiation for Solving Unconstrained Optimization Problems
In our paper, we introduce a sparse and symmetric matrix completion quasi-Newton model using automatic differentiation, for solving unconstrained optimization problems where the sparse structure of the Hessian is available. The proposed method is a kind of matrix completion quasi-Newton method and has some nice properties. Moreover, the presented method keeps the sparsity of the Hessian exactly and satisfies the quasi-Newton equation approximately. Under the usual assumptions, local and superlinear convergence are established. We tested the performance of the method, showing that the new method is effective and superior to matrix completion quasi-Newton updating with the Broyden–Fletcher–Goldfarb–Shanno (BFGS) method and the limited-memory BFGS method.
- 1 May 2015
- Published by Elsevier in Journal of Computational Science
- Vol. 8, 101-108
An efficient conjugate gradient method and application to dynamic force reconstruction
- 1 May 2015
- Published by Elsevier in Journal of Computational Science
- Vol. 8, 101-108
An efficient conjugate gradient method and application to dynamic force reconstruction
- Open Access
- 14 October 2014
- Published by Wiley in Abstract and Applied Analysis
- Vol. 2014, 1-12
Global Convergence of Schubert’s Method for Solving Sparse Nonlinear Equations
Schubert’s method is an extension of Broyden’s method for solving sparse nonlinear equations, which can preserve the zero-nonzero structure defined by the sparse Jacobian matrix and can retain many good properties of Broyden’s method. In particular, Schubert’s method has been proved to be locally andq-superlinearly convergent. In this paper, we globalize Schubert’s method by using a nonmonotone line search. Under appropriate conditions, we show that the proposed algorithm converges globally and superlinearly. Some preliminary numerical experiments are presented, which demonstrate that our algorithm is effective for large-scale problems.
- 14 October 2014
- Published by Wiley in Abstract and Applied Analysis
- Vol. 2014, 1-12
Open AccessGlobal Convergence of Schubert’s Method for Solving Sparse Nonlinear Equations
Schubert’s method is an extension of Broyden’s method for solving sparse nonlinear equations, which can preserve the zero-nonzero structure defined by the sparse Jacobian matrix and can retain many good properties of Broyden’s method. In particular, Schubert’s method has been proved to be locally andq-superlinearly convergent. In this paper, we globalize Schubert’s method by using a nonmonotone line search. Under appropriate conditions, we show that the proposed algorithm converges globally and superlinearly. Some preliminary numerical experiments are presented, which demonstrate that our algorithm is effective for large-scale problems.