Global convergence of new modified CG method with inexact line search

Authors

  • Latif S. Ivan Dept. of Mathematics, College of Education, University of Salahaddin, Erbil, Kurdistan Region, Iraq. Author
  • Mohammed J. Lajan Dept. of Mathematics, Faculty of Science and Education, School of Science, University of Sulaimani, Kurdistan Region, Iraq. Author

DOI:

https://doi.org/10.17656/jzs.10290

Keywords:

Unconstrained optimization, General line search method, Conjugate gradient method (CG), Inexact line search, Global convergence

Abstract

he conjugate gradient (CG) method has played a special role in solving non-linear unconstrained optimization problems due to the simplicity of their-iterations and their very low memory requirements. In this paper we take a modified to the Dai-Yuan (DY) conjugate gradient methods such that the direction generated by the modified method provides a descent direction for the optimization function and establish some global convergence of the proposed method. Numerical results effective and promising by comparing with CG method.

References

[ 1 ] Beale, E., "Introduction to optimization"; Wiley Inter Science series in Discrete

Mathematics and Optimization, (1988).

[ 2 ] Bazarad, M., Sherali, H. and Sheety, C.M.,"nonlinear Programing Theory and

Application", Johan Wiley and Sons, New York,(1993).

[ 3 ] Bunday, B.D., "Basic Optimization Methods" Edward Arnold,Bedford square,

London, (1984).

[ 4 ] Dai Y.H., Yuan Y., "A nonlinear conjugate gradient method with a strong global

convergence property ", SIAM J.Optim, No. 10, pp. 177-182, (1999). DOI: https://doi.org/10.1137/S1052623497318992

[ 5 ] Edwin K.P. and Stanislaw H.Zak., "An Introduction to optimization", Wiley inter

Science series in Discrete Mathematics and Optimization 2nd Edition, (2001).

[ 6 ] Fletcher R., Reeves C., "Function minimization by conjugate gradients, Compute ",

No. J.7, pp. 149-154, (1964). DOI: https://doi.org/10.1093/comjnl/7.2.149

[ 7 ] Fletcher R., "practical Method of optimization", vol (1): Unconstrained

Optimization, 2nd Edition, John Wiley and Sons Ltd., New York, (1987).

[ 8 ] Yn G., Zhao Y., Wei Z., "A descent nonlinear conjugate gradient method for large

scale unconstrained optimization", Applied Mathematics and computation, No. 187,

pp. 636-643, (2007).

[ 9 ] Hestenes, M.R., "Conjugate Direction Method in Optimization", Spring-Verlage,

New York, Heidderg, Berlin,(1980).

[ 10 ] Hestenses M.R., Stiefel I., "Method of conjugate gradient for solving linear

equations", J.Res.Nati. Bur.Standerds No. 49, pp. 409-436, (1952). DOI: https://doi.org/10.6028/jres.049.044

[ 11 ] Nocedal J. and Wright S.J., "Numerical optimization" Springer-Verlag New York,

(2006).

[ 12 ] Polak E., Ribere G., " Note sur , la convergence de directions conjugates",

Rev.Francainse informate Recherché Optimization ,No. 3,pp. 35-43, (1969).

[ 13 ] Wolfe M.A., "numerical methods for Unconstrained Optimization", Van Nostrand

Reihold Company Ltd,New York,(1978).

[ 14 ] Yaun Y., "Numerical Methods for Nonlinear Programming", Shanghai Scientific and

Technical Publishers, Chinese, (1993).

Published

2014-04-24

How to Cite

Global convergence of new modified CG method with inexact line search. (2014). Journal of Zankoy Sulaimani - Part A, 16(2), 17-26. https://doi.org/10.17656/jzs.10290

Most read articles by the same author(s)

1 2 3 4 5 6 7 8 9 10 > >>