A Diagnostic Treatment of Unconstrained Optimization Problems via a Modified Armijo line search technique.

Abstract

The study of optimization is getting broader with every passing day. Optimization is basically the art of getting the best results under a given set of circumstances. A very simple but important class of optimization problems is the unconstrained problems. Several techniques have been developed to handle unconstrained problems, one of which is the conjugate gradient method (CGM), which is iterative in nature. In this work, we applied the nonlinear CGM to solve unconstrained problems using inexact line search techniques. We employed the well-known Armijo line search criterion and its modified form

Keywords: Conjugate Gradient Method, Line Search, Step Length, Unconstrained Problems

Unique Article ID: IJMSS-152A

Article Review Status: Review Completed - Accepted (Pay Publication Fee)

If your article’s review has been completed, please ensure you check your email for feedback.

Creative Commons Licence
This work by European American Journals is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License

  • Our Journal Publishing Partners