A relaxed nonmonotone adaptive trust region method for solving unconstrained optimization problems

A relaxed nonmonotone adaptive trust region method for solving unconstrained optimization problems

0.00 Avg rating0 Votes
Article ID: iaor201526072
Volume: 61
Issue: 2
Start Page Number: 321
End Page Number: 341
Publication Date: Jun 2015
Journal: Computational Optimization and Applications
Authors: ,
Keywords: heuristics
Abstract:

In this paper, we present a new relaxed nonmonotone trust region method with adaptive radius for solving unconstrained optimization problems. The proposed method combines a relaxed nonmonotone technique with a modified version of the adaptive trust region strategy proposed by Shi and Guo (J Comput Appl Math 213:509–520, 2008). Under some suitable and standard assumptions, we establish the global convergence property as well as the superlinear convergence rate for the new method. Numerical results on some test problems show the efficiency and effectiveness of the new proposed method in practice.

Reviews

Required fields are marked *. Your email address will not be published.