Dong-Hui Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Dong-Hui Li has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Weijun Zhou
Institute of Crop Science, Ministry of Agriculture and Rural Affairs Key Laboratory of Spectroscopy Sensing, Zhejiang University
2 shared publications - Yunhai Xiao
Center for Applied Mathematics of Henan Province, Henan University, Zhengzhou, China
2 shared publications - Li Zhang
College of Mathematics and Computational Science, Changsha University of Science and Technology, Changsha 410076, China
1 shared publication - Liqun Qi
Department of Applied Mathematics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
1 shared publication Taowen Liu
Institute of Applied Mathematics , Hunan University , Changsha, People's Republic of China
1 shared publication- Vera Roshchina
UNSW Sydney
1 shared publication
Latest Publications
- 1 March 2014
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 67 (5) , 1016-1023
An active set truncated Newton method for large-scale bound constrained optimization
- 1 March 2014
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 67 (5) , 1016-1023
An active set truncated Newton method for large-scale bound constrained optimization
- 9 July 2009
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 48 (3) , 515-532
Sufficient descent directions in unconstrained optimization
- 9 July 2009
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 48 (3) , 515-532
Sufficient descent directions in unconstrained optimization
- Open Access
- 19 May 2008
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 77 (264) , 2231-2240
A globally convergent BFGS method for nonlinear monotone equations without any merit functions
Since 1965, there has been significant progress in the theoretical study on quasi-Newton methods for solving nonlinear equations, especially in the local convergence analysis. However, the study on global convergence of quasi-Newton methods is relatively fewer, especially for the BFGS method. To ensure global convergence, some merit function such as the squared norm merit function is typically used. In this paper, we propose an algorithm for solving nonlinear monotone equations, which combines the BFGS method and the hyperplane projection method. We also prove that the proposed BFGS method converges globally if the equation is monotone and Lipschitz continuous without differentiability requirement on the equation, which makes it possible to solve some nonsmooth equations. An attractive property of the proposed method is that its global convergence is independent of any merit function.We also report some numerical results to show efficiency of the proposed method.
- 19 May 2008
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 77 (264) , 2231-2240
Open AccessA globally convergent BFGS method for nonlinear monotone equations without any merit functions
Since 1965, there has been significant progress in the theoretical study on quasi-Newton methods for solving nonlinear equations, especially in the local convergence analysis. However, the study on global convergence of quasi-Newton methods is relatively fewer, especially for the BFGS method. To ensure global convergence, some merit function such as the squared norm merit function is typically used. In this paper, we propose an algorithm for solving nonlinear monotone equations, which combines the BFGS method and the hyperplane projection method. We also prove that the proposed BFGS method converges globally if the equation is monotone and Lipschitz continuous without differentiability requirement on the equation, which makes it possible to solve some nonsmooth equations. An attractive property of the proposed method is that its global convergence is independent of any merit function.We also report some numerical results to show efficiency of the proposed method.
- 1 April 2008
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 23 (2) , 237-249
A new class of quasi-Newton updating formulas
In this paper, we propose a derivative-free quasi-Newton condition, which results in a new class of quasi-Newton updating formulas for unconstrained optimization. Each updating formula in this class is a rank-two updating formula and preserves the positive definiteness of the second derivative matrix of the quadratic model. Its first two terms are the same as the first two terms of the BFGS updating formula. We establish global convergence of quasi-Newton methods based upon the updating formulas in this class, and superlinear convergence of a special quasi-Newton method among them. Then we propose a special quasi-Newton updating formula, which repetitively uses the new quasi-Newton condition. This updating formula is derivative-free. Numerical results are reported.
- 1 April 2008
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 23 (2) , 237-249
A new class of quasi-Newton updating formulas
In this paper, we propose a derivative-free quasi-Newton condition, which results in a new class of quasi-Newton updating formulas for unconstrained optimization. Each updating formula in this class is a rank-two updating formula and preserves the positive definiteness of the second derivative matrix of the quadratic model. Its first two terms are the same as the first two terms of the BFGS updating formula. We establish global convergence of quasi-Newton methods based upon the updating formulas in this class, and superlinear convergence of a special quasi-Newton method among them. Then we propose a special quasi-Newton updating formula, which repetitively uses the new quasi-Newton condition. This updating formula is derivative-free. Numerical results are reported.
- 7 March 2008
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 67 (3) , 443-454
An active set limited memory BFGS algorithm for large-scale bound constrained optimization
- 7 March 2008
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 67 (3) , 443-454
An active set limited memory BFGS algorithm for large-scale bound constrained optimization
- 13 August 2007
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- Vol. 28 (7-8) , 927-944
Convergence of the BFGS-SQP Method for Degenerate Problems
In this paper, we propose a BFGS (Broyden–Fletcher–Goldfarb–Shanno)-SQP (sequential quadratic programming) method for nonlinear inequality constrained optimization. At each step, the method generates a direction by solving a quadratic programming subproblem. A good feature of this subproblem is that it is always consistent. Moreover, we propose a practical update formula for the quasi-Newton matrix. Under mild conditions, we prove the global and superlinear convergence of the method. We also present some numerical results.
- 13 August 2007
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- Vol. 28 (7-8) , 927-944
Convergence of the BFGS-SQP Method for Degenerate Problems
In this paper, we propose a BFGS (Broyden–Fletcher–Goldfarb–Shanno)-SQP (sequential quadratic programming) method for nonlinear inequality constrained optimization. At each step, the method generates a direction by solving a quadratic programming subproblem. A good feature of this subproblem is that it is always consistent. Moreover, we propose a practical update formula for the quasi-Newton matrix. Under mild conditions, we prove the global and superlinear convergence of the method. We also present some numerical results.
- 5 September 2006
- Published by Springer Nature in Numerische Mathematik
- Vol. 104 (4) , 561-572
Global convergence of a modified Fletcher–Reeves conjugate gradient method with Armijo-type line search
- 5 September 2006
- Published by Springer Nature in Numerische Mathematik
- Vol. 104 (4) , 561-572
Global convergence of a modified Fletcher–Reeves conjugate gradient method with Armijo-type line search