Loading...

A non-monotone trust region algorithm for unconstrained optimization with dynamic reference iteration updates using filter

Fatemi, M ; Sharif University of Technology | 2012

377 Viewed
  1. Type of Document: Article
  2. DOI: 10.1080/02331934.2012.668544
  3. Publisher: 2012
  4. Abstract:
  5. We present a non-monotone trust region algorithm for unconstrained optimization. Using the filter technique of Fletcher and Leyffer, we introduce a new filter acceptance criterion and use it to define reference iterations dynamically. In contrast with the early filter criteria, the new criterion ensures that the size of the filter is finite. We also show a correlation between problem dimension and the filter size. We prove the global convergence of the proposed algorithm to first- and second-order critical points under suitable assumptions. It is significant that the global convergence analysis does not require the common assumption of monotonicity of the sequence of objective function values in reference iterations, as assumed by the standard non-monotone trust region algorithms. Numerical experiments on the CUTEr problems indicate that the new algorithm is competitive compared to some representative non-monotone trust region algorithms
  6. Keywords:
  7. filter methods ; non-monotone trust region algorithms ; unconstrained optimization
  8. Source: Optimization ; Volume 61, Issue 6 , 2012 , Pages 733-763 ; 02331934 (ISSN)
  9. URL: http://www.tandfonline.com/doi/abs/10.1080/02331934.2012.668544#.Vqca5U_cDcs