𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new nonmonotone trust-region method of conic model for solving unconstrained optimization

✍ Scribed by Ying Ji; Yijun Li; Kecun Zhang; Xinli Zhang


Book ID
108075674
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
484 KB
Volume
233
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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

A new trust region method for unconstrai
✍ 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