Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2204.11508 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- 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.