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 filter trust region method for nonlinear constrained optimization
β Scribed by Ke Su; Dingguo Pu
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 471 KB
- Volume
- 223
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## 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 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
This paper discusses nonlinear complementarity problems; its goal is to present a globally and superlinearly convergent algorithm for the discussed problems. Filter methods are extensively studied to handle nonlinear complementarity problem. Because of good numerical results, filter techniques are a
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
## 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