• 대한전기학회
Mobile QR Code QR CODE : The Transactions of the Korean Institute of Electrical Engineers
  • COPE
  • kcse
  • 한국과학기술단체총연합회
  • 한국학술지인용색인
  • Scopus
  • crossref
  • orcid
The Transactions of the Korean Institute of Electrical Engineers

The Transactions of the Korean Institute of Electrical Engineers

ISO Journal TitleTrans. Korean. Inst. Elect. Eng.
SCImago Journal & Country Rank

Journal Search

  1. Home
  2. Archive
  3. 2024-08 (Vol.73 No.08)
  4. 10.5370/KIEE.2024.73.8.1437
XML PDF INFO REF

References

1 
Magnus R. Hestenes, Eduard Stiefel, “Methods of Conjugate Gradients for Solving Linear Systems,” Journal of Research of the National Bureau of Standards, vol. 49, no. 6, pp. 409-436, December 1952.URL
2 
R. Fletcher, and C. M. Reeves, “Function minimization by conjugate gradients,” Computer. J. vol. 7, no. 2, pp. 149-154, 1964.URL
3 
Boris T. Polyak, “The Conjugate Gradient method in extreme problem,” pp. 94-112, Nov. 1969.URL
4 
E. Polak, G. Ribiére, “Note sur la convergence de méthodes de directions conjugués,” Revnue franaise d’informatique et de recherche opérationnelle, série rouge, tome 3, no. 1, pp. 35-43, 1969.URL
5 
M. J. D. Powell, “Restart Procedures for the Conjugate Gradient Method,” Mathematical Programming, vol. 12, pp. 241-254, 1977.URL
6 
R. Fletcher, Practical Methods of Optimization, vol. 1: Unconstrained Optimization, John Wiley \& Sons, New York, pp. 80-87, 1987.URL
7 
Borris T. Polyak, Introduction to Optimization, Optimization Software, Inc., Publications Division, pp. 95-116, 1987.URL
8 
Gene H. Golub, Dianne P. O’Leary, “Some history of the Conjugate Gradient and Lanczos Algorithms: 1948-1976,” SIAM Review vol. 31, no. 1, pp. 50-102, March 1989.DOI
9 
D. Touati-Ahmed, and C. Storey, “Efficient Hybrid Conjugate Techniques,” J. of Optimization Theory and Applications, vol. 64, no. 2, Feb. 1990.URL
10 
Edwin K. O. Chong, Stanislaw H. Zak, An Introduction to Optimization, Wiley, pp. 151-186, 1996.URL
11 
William W. Hager, Hongchao Zhang, “A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search,” SIAM J. OPTIM., vol. 16, no. 1, pp. 170-192, 2005.DOI
12 
William W. Hager, Hongchao Zhang, “A Survey of Nonlinear Conjugate Gradient Method,” Pacific Journal of Optimization, January 2006.URL
13 
Gonglin Yuan, Xiwen Lu. “A Modified PRP conjugate gradient method,” Ann Oper Res, vol. 166, pp. 73-90, 2009. DOI 10.1007/s10479 –008-0420-4,URL
14 
Gonglin Yuan, Xiwen Lu, Zhan Wang, “The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration,” Applied Numerical Mathematics, vol. 152, pp. 1-11, 2020.DOI
15 
Neculai Andrei, Nonlinear Conjugate Gradient Methods for Unconstrained Optimization, vol. 158, pp. 67-214, ISBN: 978-3-030-42949-2, Springer, 2020.URL
16 
Reme Chan-Renous-Legoubin, Clement W. Royer, “A Nonlinear conjugate gradient method with complexity guarantees and its application to non-convex regression,” EURO J. Comput. Optim. 10, 100043, 2022.URL
17 
Awad Abdelrahman, Morgataba Mohammed, Osman O., Murtada K., “A Nonlinear conjugate gradient Coefficients with Exact and Strong Wolfe Line Searches Techniques,” Journal of Mathematics, vol. 2022. no. 1, 2022. http://doi.org/10.1155/2022/1383129.DOI
18 
C. Cartis, N. I. M. Gould, and Ph. L. Toint, “Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization,” Mathematical Programming, vol. 163, no. 1, pp. 359-368, 2017DOI
19 
Cartis, C., Sampaio, Ph. R., and Toint, Ph. L., “Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization.” Optimization, vol. 64, no. 5, pp. 1349–1361, 2014. https://doi.org/10.1080/02331934.2013.869809.DOI