Skip to main content
Log in

Global convergence properties of the modified BFGS method associating with general line search model

  • Published:
Journal of Applied Mathematics and Computing Aims and scope Submit manuscript

Abstract

To the unconstrained programme of non-convex function, this article give a modified BFGS algorithm. The idea of the algorithm is to modify the approximate Hessian matrix for obtaining the descent direction and guaranteeing the efficacious of the quasi-Newton iteration pattern. We prove the global convergence properties of the algorithm associating with the general form of line search, and prove the quadratic convergence rate of the algorithm under some conditions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J. J. Dennis and J. J. Moré,Quasi-Newton methods, motivation and theory [J], SIAM REIEW19 (1977), 46–89.

    Article  MATH  Google Scholar 

  2. M. J. D. Powell,Some Global Convergence Properties of a Variable Metric Algorithm for Minimization without Exact Line Searches, Nonlinear Programming, SIAM-AMS proceedings, Cottle R W and Lemke C E, eds.9 (1976), 53–72.

  3. J. Werner,Uber die global konvergenze von variablemetric verfahren mit nichtexakter schrittweitenbestimmong, Numer. Math.31 (1978), 321–334.

    Article  MATH  MathSciNet  Google Scholar 

  4. J. D. Pearson,Variable Metric Methods of Minimization, Computer J.12 (1969), 171–178.

    Article  MATH  MathSciNet  Google Scholar 

  5. Han and Liu,General Form of Stepsize Selection Rules of Linesearch and Relevant Analysis of Global Convergence of BFGS Algorithm (Chinese), Acta Mathematicae Appliatae Sinica1 (1995), 112–122.

    MathSciNet  Google Scholar 

  6. R. H. Byrd and J. Nocedal,A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization, SIAM J. Numer. Anal.3 (1989), 727–739.

    Article  MathSciNet  Google Scholar 

  7. J. M. Gorge, S. G. Burton and E. H. Kenneth,Testing unconstrained optimization software, ACM Trans. Math. Software7 (1981), 208–215.

    Google Scholar 

  8. Rendong Ge and Zunquan Xia,An ABS Algorithm for Solving Singular Nonlinear System with Rank One Defect, J. Appl. Math. and Computing (old:KJCAM)9 (2002), 167–184.

    MATH  MathSciNet  Google Scholar 

  9. Rendong Ge and Zunquan Xia,An ABS Algorithm for Solving Singular Nonlinear System with Rank Defects, J. Appl. Math. & Computing5 (2003), 1–20.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jian-Guo Liu.

Additional information

Jian-Guo Liu is a doctoral student in Institute of System Engineering, Dalian University of Technology. His research interests are the numerical computation and software, numerical methods for optimization, System Engineering.

Qiang Guo is doctor in Department of Applied Mathematics and Physics, Dalian National University. Her research interests are the optimal design, numerical computation and software, numerical methods for optimization, optimization methods in science and engineering, nonsmooth optimization.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, JG., Guo, Q. Global convergence properties of the modified BFGS method associating with general line search model. JAMC 16, 195–205 (2004). https://doi.org/10.1007/BF02936161

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02936161

AMS Mathematics Subject Classification

Key words and phrases

Navigation