General Form of Nonmonotone Line Search Techniques For Unconstrained Optimization

Authors

  • Zhensheng Yu
  • Ji Lin

Keywords:

Unconstrained optimization, Nonmonotone F-rule, Global convergence

Abstract

By using the forcing function, we proposed a general form of nonmonotone line search technique for unconstrained optimization. The technique includes some well known nonmonotone line search as special cases while independence on the nonmonotone parameter. We establish the global convergence of the method under weak conditions and we report the numerical test with a modified BFGS method to show the effectiveness of the proposed method.

Downloads

Additional Files

Published

2009-02-03

How to Cite

Yu, Z., & Lin, J. (2009). General Form of Nonmonotone Line Search Techniques For Unconstrained Optimization. Algorithmic Operations Research, 4(1), Pages 70 – 75. Retrieved from https://journals.lib.unb.ca/index.php/AOR/article/view/8288

Issue

Vol. 4 No. 1 (2009)

Section

Articles

License

The copyright of the submitted article is hereby transferred to “Preeminent Academic Facets Inc. (the “publisher”) to the extent possible by the laws in the respective countries of the author(s). The author(s) retain all other rights including the following: 1. Any patents and trademark rights. 2. Right to post a pre-print version of the paper on the author’s personal website which is not used for commercial purposes. The author(s) warrant that the work is original, it has not been published elsewhere, it is not currently under consideration for publication in any form, and it does not infringe any copyright laws. The signing author or agent further warrants that all authors, if applicable, have been informed of the terms of this agreement and obtained the approval and authority to sign the agreement.