An n-th section line search in conjugate gradient method for small-scale unconstrained optimization
DOI:
https://doi.org/10.11113/mjfas.v0n0.579Keywords:
Unconstrained Optimization, Conjugate Gradient, Bisection, Line SearchAbstract
Conjugate Gradient (CG) methods are well-known method for solving unconstrained optimization problem and popular for its low memory requirement. A lot of researches and efforts have been done in order to improve the efficiency of this CG method. In this paper, a new inexact line search is proposed based on Bisection line search. Initially, Bisection method is the easiest method to solve root of a function. Thus, it is an ideal method to employ in CG method. This new modification is named n-th section. In a nutshell, this proposed method is promising and more efficient compared to the original Bisection line search.
References
Andrei, N. (2008). An unconstrained optimization test functions collection, Advanced Modeling and Optimization. 10: 147–161.
Andrei N. (2011). Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization, Bulletin of the Malaysian Mathematical Sciences Society, (2) 34(2):319–330.
Cauchy, A. (1847). General methods in analysis for the resolution of linear equation. Comptes Rendus de l'Académie des Sciences de Paris, 25: 536-538.
Chong, E. K. P. and Zak, S. H. (2013). An Introduction to Optimization (4th ed). New York: John Wiley and Sons.
Dolan, D. E., and Moré, J. J. (2002). Benchmarking optimization software with performance profiles. Mathematical Programming, 91(2): 201–213. article.
Doron, L. (2010). Introduction to Numerical Analysis. Departments of Mathematics and Center of Scientific Computation and Mathematical Modeling (CSCAMM) University of Maryland. Retrieved from http://www2.math.umd.edu/~dlevy/books/na.pdf
Fletcher, R. and Reeves, C. (1964). Function minimization by conjugate gradients. The Computer Journal, 7: 149-154.
Hamoda, M., Rivaie, M., Mamat, M., Salleh, Z. (2015). A conjugate ization. Applied Mathematical Sciences. 9(37): 1823–1832.
Jansson, C. and Knuppel, O. (1992). A global minimization method: The multi dimensional case. Technical Report, 92.1. Hamburg: Technische Informatik III.
Mishra, S. (2006). Some new test functions for global optimization and performance of repulsive particle swarm method. Department of Economics, North-Eastern Hill University, Shillong, India. Retrieved from https://pdfs.semanticscholar.org/a988/b9cfe708089edecf46085833165db2c254b6.pdf
Polak, E. and Ribiere, G. (1969). Note on the convergence of methods of conjugate directions. Revue française d'informatique et de recherche opérationnelle, 3: 35-43.
Polyak B.T. (1969), The conjugate gradient method in extreme problem, USSR Computational Mathematics and Mathematical Physics, 9: 94-112.
Rivaie, M., Mamat, M., Leong, W. J. and Mohd, I. (2012). A new class of nonlinear conjugate gradient coefficient with global convergence properties. Applied Mathematics and Computation, 218 :11323-11332.
Snyman, J. A. (2005). Practical Mathematical Optimization. Media, New York: Springer Science and Business.
Witte, B. F. and Holst, W.R. (1964). Two new direct minimum search procedures for functions of several variables. Proceedings of the April 21-23, 1964, Spring Joint Computer Conference (Washington, D.C., April 21-23, 1964). AFIPS’64 (Spring). ACM, New York, NY, 195-205.
