scholarly journals A limited memory quasi-Newton trust-region method for box constrained optimization

2016 ◽  
Vol 303 ◽  
pp. 105-118 ◽  
Author(s):  
Farzad Rahpeymaii ◽  
Morteza Kimiaei ◽  
Alireza Bagheri
2015 ◽  
Vol 5 (3) ◽  
pp. 237-249 ◽  
Author(s):  
Honglan Zhu ◽  
◽  
Qin Ni ◽  
Meilan Zeng ◽  

2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
Yang Weiwei ◽  
Yang Yueting ◽  
Zhang Chenhui ◽  
Cao Mingyuan

We present a new Newton-like method for large-scale unconstrained nonconvex minimization. And a new straightforward limited memory quasi-Newton updating based on the modified quasi-Newton equation is deduced to construct the trust region subproblem, in which the information of both the function value and gradient is used to construct approximate Hessian. The global convergence of the algorithm is proved. Numerical results indicate that the proposed method is competitive and efficient on some classical large-scale nonconvex test problems.


2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Honglan Zhu ◽  
Qin Ni ◽  
Liwei Zhang ◽  
Weiwei Yang

A quasi-Newton trust region method with a new fractional model for linearly constrained optimization problems is proposed. We delete linear equality constraints by using null space technique. The fractional trust region subproblem is solved by a simple dogleg method. The global convergence of the proposed algorithm is established and proved. Numerical results for test problems show the efficiency of the trust region method with new fractional model. These results give the base of further research on nonlinear optimization.


2019 ◽  
Vol 53 (3) ◽  
pp. 787-805
Author(s):  
Lijuan Zhao

In this paper, we propose a nonmonotone trust region method for bound constrained optimization problems, where the bounds are dealt with by affine scaling technique. Differing from the traditional trust region methods, the subproblem in our algorithm is based on a conic model. Moreover, when the trial point isn’t acceptable by the usual trust region criterion, a line search technique is used to find an acceptable point. This procedure avoids resolving the trust region subproblem, which may reduce the total computational cost. The global convergence and Q-superlinear convergence of the algorithm are established under some mild conditions. Numerical results on a series of standard test problems are reported to show the effectiveness of the new method.


Sign in / Sign up

Export Citation Format

Share Document