Skip to main content
Log in

Global convergence of a modified BFGS-type method for unconstrained non-convex minimization

  • 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 associated with the general line search model. The idea of the algorithm is to modify the approximate Hessian matrix for obtaining the descent direction and guaranteeing the efficacious of the new quasi-Newton iteration equationB k +1s k =y *k ,, wherey *k is the sum ofy k andA k s k , andA k is some matrix. The global convergence properties of the algorithm associating with the general form of line search is proved.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. J. Dennis, J. J. Moré,Quasi-Newton methods, motivation and theory, 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.

    MathSciNet  Google Scholar 

  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. Walter F. Mascarenhas,The BFGS method with exact line searches fails for non-convex objective functions, Math. Program.99 (2004) 49C61.

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. 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 

  7. L. Armijo,Minimization of functions having lipschitz-continuous first partial derivatives, Pacific J. of Mathematics,16 1-3.

  8. A. Goldstein, and J. Price,An effective algorithm for minimization, Numericahe Mathematik10 (1967) 184–189.

    Article  MATH  MathSciNet  Google Scholar 

  9. P. Wolfe,Convergence conditions for ascent methods, SIAM Review11 (1969) 226–235.

    Article  MATH  MathSciNet  Google Scholar 

  10. J. G. Liu, Q. Guo,Global Convergence Properties of the Modified BFGS Method, J. of Appl. Math. & Computing16 (2004) 195–205.

    Article  MATH  MathSciNet  Google Scholar 

  11. J. G. Liu, Z. Q. Xia, R. D. Ge, and Q. Guo,An modified BFGS method for non-convex minimization problems (Chinese), Operation Research and Management13 (2004) 62–65.

    Google Scholar 

  12. Z. X. Wei, G. H. Yu, G. L. Yuan, Z. G. Lian,The superlinear convergence of a modifed BFGS-Type method for unconstrained optimization, Computational optimization and applications29 (2004) 315–332.

    Article  MATH  MathSciNet  Google Scholar 

  13. Z. Wei, G. Li, and L. Qi,New quasi-Newton methods for unconstrained optimization probelms, to appear in mathematical programming.(search the paper).

  14. Z. Wei, L. Qi, and X. Chen,An SQP-type method and its application in stochastic programming, J. Optim. Theory Appl.116 (2003) 205–228.

    Article  MATH  MathSciNet  Google Scholar 

  15. 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 

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

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jian-Guo Liu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guo, Q., Liu, JG. Global convergence of a modified BFGS-type method for unconstrained non-convex minimization. J. Appl. Math. Comput. 24, 325–331 (2007). https://doi.org/10.1007/BF02832321

Download citation

  • Received:

  • Issue Date:

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

AMS Mathematics Subject Classification

Key words and phrases

Navigation