Volume 17, Issue 1 (3-2020)                   2020, 17(1): 85-101 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Saeidian Tarei Z, Arzani F. Solving the Unconstrained Optimization Problems Using the Combination of Nonmonotone Trust Region Algorithm and Filter Technique. Journal of Operational Research and Its Applications. 2020; 17 (1) :85-101
URL: http://jamlu.liau.ac.ir/article-1-1822-en.html
Assistant Professor, Department of Mathematics,University of Kashan, Isfahan, Iran
Abstract:   (1343 Views)
In this paper, we propose a new nonmonotone adaptive trust region method for solving unconstrained optimization problems that is equipped with the filter technique. In the proposed method, the various nonmonotone technique is used. Using this technique, the algorithm can advantage from nonmonotone properties and it can increase the rate of solving the problems.
Also, the filter that is used in this method is the kind of finite filter. It is proofed due to the filter structure. The construction of the algorithm is based on the two interior and exterior cycles that both of them do the specified operations based on the available conditions. In the iteration of our algorithm, we use a simple subproblem for finding the trial step and we imply the corrected form of Secant condition for approximating the Hessian matrix in order to save the positive definite property of Hessian matrix. Also, the global convergence of the algorithm is established under some standard properties. Furthermore, the numerical results on some test problems show the efficiency and effectiveness of the new algorithm in comparison to some other algorithms.
Full-Text [PDF 1332 kb]   (345 Downloads)    
Type of Study: Research | Subject: Special
Received: 2019/01/27 | Accepted: 2019/09/25 | Published: 2020/03/29

Add your comments about this article : Your username or Email:

Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.