A New Parameterized Conjugate Gradient Method based on Generalized Perry Conjugate Gradient Method
Article Sidebar
Main Article Content
Abstract
A New Parameterized Conjugate Gradient Method based on Generalized Perry Conjugate Gradient Method is proposed to be based on Perry's idea, the descent condition and the global convergent is proven under Wolfe condition. The new algorithm is very effective for solve the large-scale unconstrained optimization problem
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
Tikrit Journal of Pure Science is licensed under the Creative Commons Attribution 4.0 International License, which allows users to copy, create extracts, abstracts, and new works from the article, alter and revise the article, and make commercial use of the article (including reuse and/or resale of the article by commercial entities), provided the user gives appropriate credit (with a link to the formal publication through the relevant DOI), provides a link to the license, indicates if changes were made, and the licensor is not represented as endorsing the use made of the work. The authors hold the copyright for their published work on the Tikrit J. Pure Sci. website, while Tikrit J. Pure Sci. is responsible for appreciate citation of their work, which is released under CC-BY-4.0, enabling the unrestricted use, distribution, and reproduction of an article in any medium, provided that the original work is properly cited.
References
1. Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Natl. Bur. Stand. 49(6), 409–439 (1952)
2. Fletcher, R.M., Reeves, C.M.: Function minimization by conjugate gradients. Comput. J. 7, 149–154 (1964)
3. Polak, E., Ribière, G.: Note sur la convergence de méthodes de directions conjuguées. Rev. Fr. Inform. Rech. Oper. 3(16), 35–43 (1969)
5. Liu, Y., Storey, C.: Efficient generalized conjugate gradient algorithms, part 1: theory. J. Optim. Theory Appl. 69, 129–137 (1991)
4. Dai, Y.H., Yuan, Y.X.: A nonlinear conjugate gradient with a strong global convergence properties. SIAM J. Optim. 10, 177–182 (1999)
6. Liu, D.Y., Shang, Y.F.: A new Perry conjugate gradient method with the generalized conjugacy condition. In: Computational Intelligence and Software Engineering (CiSE), 2010 International Conference on Issue Date: 10–12 Dec. 2010. doi:10.1109/CISE.2010.5677114
7. Perry, A.: A modified conjugate gradient algorithm. Oper. Res., Tech. Notes 26(6), 1073–1078 (1978)
8. W. W. Hager and H. Zhang, A new conjugate gradient method with guaranteed descent and an efficient line search, SIAM J. Optim. 16 (2005), pp. 170–192.
9. Liu, D.Y., Xu, G.Q.: A Perry descent conjugate gradient method with restricted spectrum, optimization online, nonlinear optimization (unconstrained optimization), March 2011. http://www. optimization-online.org/ DB_ HTML/ 2011/03/2958.html
10- Powell, M.J.D., (1984), Nonconvex Minimization Calculations and the Conjugate Gradient Method, Lecture Notes in Mathematics, Vol. 1066, pp. 122-141.
11- Dai, Y.H, Yuan, Y., (1999), A Nonlinear Conjugate Gradient Method with A Strong Global Convergence Property, SIAM J. Optim., 10: pp.177-182.
12- E. D. Dolan, J. J. Mor´e, Benchmarking optimization software with performance profiles, Mathematical Programming Ser. A,91(2002), 201–213.