Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
469671 | Computers & Mathematics with Applications | 2009 | 16 Pages |
Abstract
In this paper we consider a conic trust-region method for unconstrained optimization problems and analyze its convergence properties. We propose a convenient curvilinear search method to approximately solve the arising conic trust-region subproblem. Note that this approximate method preserves the strong convergence properties of the exact solution methods and is easy to implement. Both the linear and superlinear convergence of the method are established under commonly used conditions. Numerical experiments are conducted to show the efficiency of the new method.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Shao-Jian Qu, Su-Da Jiang, Ying Zhu,