A Trust Region Method for Nonlinear Programming Based on Primal Interior-Point Techniques

1998 ◽  
Vol 20 (1) ◽  
pp. 282-305 ◽  
Author(s):  
Todd Plantenga
2000 ◽  
Vol 89 (1) ◽  
pp. 149-185 ◽  
Author(s):  
Richard H. Byrd ◽  
Jean Charles Gilbert ◽  
Jorge Nocedal

2011 ◽  
Vol 28 (05) ◽  
pp. 585-600 ◽  
Author(s):  
KEYVAN AMINI ◽  
MASOUD AHOOKHOSH

In this paper, we present a new trust region method for unconstrained nonlinear programming in which we blend adaptive trust region algorithm by non-monotone strategy to propose a new non-monotone trust region algorithm with automatically adjusted radius. Both non-monotone strategy and adaptive technique can help us introduce a new algorithm that reduces the number of iterations and function evaluations. The new algorithm preserves the global convergence and has local superlinear and quadratic convergence under suitable conditions. Numerical experiments exhibit that the new trust region algorithm is very efficient and robust for unconstrained optimization problems.


Sign in / Sign up

Export Citation Format

Share Document