GLORIA

GEOMAR Library Ocean Research Information Access

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 87 (1999), S. 407-418 
    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
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...