Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T12:57:08.801Z Has data issue: false hasContentIssue false

Convergence analysis of adaptive trust region methods

Published online by Cambridge University Press:  15 June 2007

Zhen-Jun Shi
Affiliation:
College of Operations Research and Management, Qufu Normal University, Rizhao, Shandong 276826, P.R. China, and Department of Computer & Information Science, University of Michigan-Dearborn, Michigan MI48128, USA; zjshi@umd.umich.edu or zjshi@qrnu.edu.cn
Xiang-Sun Zhang
Affiliation:
Institute of Applied Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, P.O. Box 2734, Beijing 100080, P.R. China; zxs@amt.ac.cn
Jie Shen
Affiliation:
Department of Computer & Information Science, University of Michigan-Dearborn, Michigan MI48128, USA; shen@umich.edu
Get access

Abstract

In this paper, we propose a new class of adaptive trust region methods for unconstrained optimization problems and develop some convergence properties. In the new algorithms, we use the current iterative information to define a suitable initial trust region radius at each iteration. The initial trust region radius is more reasonable in the sense that the trust region model and theobjective function are more consistent at the current iterate. The global convergence, super-linear and quadratic convergence rate are analyzed under some mild conditions. Numericalresults show that some special adaptive trust region methods are available and efficient in practical computation.

Information

Type
Research Article
Copyright
© EDP Sciences, ROADEF, SMAI, 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable