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