𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Nonmonotone trust region methods with curvilinear path in unconstrained optimization

✍ Scribed by Y. Xiao; F. Zhou


Publisher
Springer Vienna
Year
1992
Tongue
English
Weight
557 KB
Volume
48
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A Nonmonotone trust region method with a
✍ Masoud Ahookhosh; Keyvan Amini πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 351 KB

## 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

A nonmonotone trust-region method of con
✍ 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
✍ 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

A trust-region method with a conic model
✍ 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