The Performance of MBFGS with Different Inexact Line Search Rule
Optimization and Control
2025-04-07 v2
Abstract
The modified BFGS optimization algorithm is generally used when the objective function is non-convex. In this method, one has to move in a specific direction such that the value of the objective function reduces. Therefore, the different inexact line search or exact line search plays an important role in optimization. Here, we have studied Modified BFGS with different inexact line searches methods and compared them in some test problems. Numerical results show that MBFGS with Armijo line search methods is efficient for solving non-convex non-linear unconstrained optimization problems.
Keywords
Cite
@article{arxiv.2204.11508,
title = {The Performance of MBFGS with Different Inexact Line Search Rule},
author = {Manish Kumar Sahu and Suvendu Ranjan Pattanaik and Santosh Kumar Panda},
journal= {arXiv preprint arXiv:2204.11508},
year = {2025}
}
Comments
This manuscript has lots of mathematical and numerical errors