ISSN:
1572-9338
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
,
Economics
Notes:
Abstract In this paper, we propose a class of convenient curvilinear search algorithms to solve trust region problems arising from unconstrained optimization. The curvilinear paths we set are dogleg paths, generated mainly by employing Bunch‐Parlett factorization for general symmetric matrices which may be indefinite. These algorithms are easy to use and globally convergent. It is proved that these algorithms satisfy the first‐ and second‐order stationary point convergence properties and that the convergence rate is quadratic under commonly used conditions.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1018957708498