𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Nonmonotone trust region method with adaptive radius for unconstrained optimization problems

✍ Scribed by Masoud Ahookhosh; Keyvan Amini

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
351 KB
Volume
60
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

✦ Synopsis

a b s t r a c t

In this paper, we incorporate a nonmonotone technique with the new proposed adaptive trust region radius (Shi and Guo, 2008) [4] in order to propose a new nonmonotone trust region method with an adaptive radius for unconstrained optimization. Both the nonmonotone techniques and adaptive trust region radius strategies can improve the trust region methods in the sense of global convergence. The global convergence to first and second order critical points together with local superlinear and quadratic convergence of the new method under some suitable conditions. Numerical results show that the new method is very efficient and robustness for unconstrained optimization problems.

πŸ“œ SIMILAR VOLUMES

A nonmonotone trust-region method of con
A nonmonotone trust-region method of conic model for unconstrained optimization
✍ Shao-Jian Qu; Ke-Cun Zhang; Jian Zhang πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 160 KB

In this paper, we present a nonmonotone trust-region method of conic model for unconstrained optimization. The new method combines a new trust-region subproblem of conic model proposed in [Y. Ji, S.J. Qu, Y.J. Wang, H.M. Li, A conic trust-region method for optimization with nonlinear equality and in

A nonmonotone conic trust region method
A nonmonotone conic trust region method based on line search for solving unconstrained optimization
✍ Shao-Jian Qu; Qing-Pu Zhang; Yue-Ting Yang πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 675 KB

In this paper, we present a nonmonotone conic trust region method based on line search technique for unconstrained optimization. The new algorithm can be regarded as a combination of nonmonotone technique, line search technique and conic trust region method. When a trial step is not accepted, the me

An ODE-based trust region method for unc
An ODE-based trust region method for unconstrained optimization problems
✍ Yigui Ou; Qian Zhou; Haichan Lin πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 485 KB

In this paper, a new trust region algorithm is proposed for solving unconstrained optimization problems. This method can be regarded as a combination of trust region technique, fixed step-length and ODE-based methods. A feature of this proposed method is that at each iteration, only a system of line

A new trust region method for unconstrai
A new trust region method for unconstrained optimization
✍ Zhen-Jun Shi; Jin-Hua Guo πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 179 KB

In this paper, we propose a new trust region method for unconstrained optimization problems. The new trust region method can automatically adjust the trust region radius of related subproblems at each iteration and has strong global convergence under some mild conditions. We also analyze the global

A trust-region method with a conic model
A trust-region method with a conic model for unconstrained optimization
✍ Shao-Jian Qu; Su-Da Jiang πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 216 KB

## Abstract In this paper, we propose and analyze a new conic trust‐region algorithm for solving the unconstrained optimization problems. A new strategy is proposed to construct the conic model and the relevant conic trust‐region subproblems are solved by an approximate solution method. This approx