Abstract
This article presents a new hybrid conjugate gradient (CG) algorithm for solving unconstrained optimization problem. The search direction is defined as a combination of Hestenes–Stiefel (HS) and the Liu–Storey (LS) CG parameters and is close to the direction of the memoryless Broyden–Fletcher–Goldferb–Shanno (BFGS) quasi-Newton direction. In addition, the search direction is descent and bounded. The global convergence of the algorithm is obtained under the Wolfe-type and Armijo-type line searches. Numerical experiments on some benchmark test problems is carried out to depict the efficiency and robustness of the hybrid algorithm. Furthermore, a practical application of the algorithm in motion control of robot manipulator and image restoration is provided.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
