QUASI NEWTON MULTI STEP n/4 SKIPPING TECHNIQUE FOR OPTIMIZATION OF UNCONSTRAINED NONLINEAR PROBLEMS

Authors

  • Nudrat Aamir
  • TAZKIA ANWAR
  • AYESHA NAWAZ
  • ANEESA ZEB
  • LUBNA ZEB

DOI:

https://doi.org/10.33959/cuijca.v3i1.12

Abstract

Ford and Moghrabi [2] introduced the multi-step quasi-Newton method for optimization, Where Hessian matrix is updated for each iteration, this make it computationally expensive. To overcome this problem Jhon and Nudrat [4] introduced a multi-step skipping technique, which shows a better experimental results. In Ford and Moghrabi, papers series, they introduced some techniques (Accumulative and Fixed-point approaches) to describe the parametric values needed to figure out the distances between many sets of iterations being involved in the recent interpolation curve.

In this thesis, we extended the existing three-step Fixed-point skipping approach and examine the sensitivity of this technique. Evidently, experimental result provides, positive improvement with comparison to standard Broyden-Fletcher-GoldfrabShanno (BFGS) method. Result shows comparatively, three-step Fixed-point skipping technique computational saves time than existing single-step BFGS method

Downloads

Published

2019-11-12

How to Cite

Aamir, N., ANWAR, T., NAWAZ, A., ZEB, A., & ZEB, L. (2019). QUASI NEWTON MULTI STEP n/4 SKIPPING TECHNIQUE FOR OPTIMIZATION OF UNCONSTRAINED NONLINEAR PROBLEMS. City University International Journal of Computational Analysis, 3(1), 41–48. https://doi.org/10.33959/cuijca.v3i1.12

Issue

Section

Articles

Most read articles by the same author(s)