𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Combining nonmonotone conic trust region and line search techniques for unconstrained optimization

✍ Scribed by Zhaocheng Cui; Boying Wu; Shaojian Qu


Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
248 KB
Volume
235
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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 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 new nonmonotone line search technique
✍ Zhensheng Yu; Dingguo Pu πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 168 KB

In this paper, we propose a new nonmonotone line search technique for unconstrained optimization problems. By using this new technique, we establish the global convergence under conditions weaker than those of the existed nonmonotone line search techniques.

A derivative-free nonmonotone line-searc
✍ M.A. Diniz-Ehrhardt; J.M. MartΓ­nez; M. Raydan πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 210 KB

A tolerant derivative-free nonmonotone line-search technique is proposed and analyzed. Several consecutive increases in the objective function and also nondescent directions are admitted for unconstrained minimization. To exemplify the power of this new line search we describe a direct search algori

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