Weijun Zhou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Weijun Zhou has a total of 1 co-authors. Here are the top co-authors by number of shared publications:
- Li Zhang
Changsha University of Science and Technology
1 shared publication
Latest Publications
- 1 January 2025
- Published by Chongqing Normal University in Pacific Journal of Optimization
- Vol. 21 (1) , 89-106
A BFGS method using inexact gradient for general nonlinear equations
(Communicated by Gui-hua Lin) A globally and superlinearly convergent BFGS method is introduced to solve general nonlinear equations without computing exact gradient. Compared with existing Gauss-Newton-based BFGS type methods, the proposed method does not require conditions such as symmetry on the underlying function. Moreover, it can be suitably adjusted to solve nonlinear least squares problems and still guarantee global convergence. Some numerical results are reported to show its eciency.
- 1 January 2025
- Published by Chongqing Normal University in Pacific Journal of Optimization
- Vol. 21 (1) , 89-106
A BFGS method using inexact gradient for general nonlinear equations
(Communicated by Gui-hua Lin) A globally and superlinearly convergent BFGS method is introduced to solve general nonlinear equations without computing exact gradient. Compared with existing Gauss-Newton-based BFGS type methods, the proposed method does not require conditions such as symmetry on the underlying function. Moreover, it can be suitably adjusted to solve nonlinear least squares problems and still guarantee global convergence. Some numerical results are reported to show its eciency.
- 1 January 2022
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 18 (2) , 1295-1303
A globally convergent BFGS method for symmetric nonlinear equations
A BFGS type method is presented to solve symmetric nonlinear equations, which is shown to be globally convergent under suitable conditions. Compared with some existing Gauss-Newton-based BFGS methods whose iterative matrix approximates the Gauss-Newton matrix, an important feature of the proposed method lies in that the iterative matrix is an approximation of the Jacobian, which greatly reduces condition number of the iterative matrix. Numerical results are reported to support the theory.
- 1 January 2022
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 18 (2) , 1295-1303
A globally convergent BFGS method for symmetric nonlinear equations
A BFGS type method is presented to solve symmetric nonlinear equations, which is shown to be globally convergent under suitable conditions. Compared with some existing Gauss-Newton-based BFGS methods whose iterative matrix approximates the Gauss-Newton matrix, an important feature of the proposed method lies in that the iterative matrix is an approximation of the Jacobian, which greatly reduces condition number of the iterative matrix. Numerical results are reported to support the theory.
- 4 March 2021
- Published by Springer Nature in Soft Computing
- Vol. 25 (10) , 7131-7141
A class of line search-type methods for nonsmooth convex regularized minimization
- 4 March 2021
- Published by Springer Nature in Soft Computing
- Vol. 25 (10) , 7131-7141
A class of line search-type methods for nonsmooth convex regularized minimization