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 conic model for unconstrained optimization
β Scribed by Shao-Jian Qu; Ke-Cun Zhang; Jian Zhang
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 160 KB
- Volume
- 220
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
β¦ Synopsis
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 inequality 4 constrains via active-set strategy, Appl. Math. Comput. 183 (2006) 217-231] with a nonmonotone technique for solving unconstrained optimization. The local and global convergence properties are proved under reasonable assumptions. Numerical experiments are conducted to compare this method with the method of [Y. Ji,
π SIMILAR VOLUMES
## 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 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
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