Branislav Ivanov, Bilall I. Shaini, Predrag S. Stanimirović

DOI Number
First page
Last page


The gradient method is a very efficient iterative technique for solving unconstrained optimization problems. Motivated by recent modifications of some variants of the SM method, this study proposed two methods that are globally convergent as well as computationally efficient. Each of the methods is globally convergent under the influence of a backtracking line search. Results obtained from the numerical implementation of these methods and performance profiling show that the methods are very competitive with well-known traditional methods.


unconstrained optimization; gradient methods; line search.

Full Text:



N. Andrei, An acceleration of gradient descent algorithm with backtracking for unconstrained optimization, Numer. Algor. 42 (2006), 63-73.

N. Andrei, An unconstrained optimization test functions collection, Adv. Model. Optim. 10 (2008), 147-161.

N. Andrei, Relaxed gradient descent and a new gradient descent methods for unconstrained optimization,, Visited August 19, 2018.

I. Bongartz, A.R. Conn, N.I.M. Gould, Ph.L. Toint, CUTEr: constrained and unconstrained testing environments, ACM Trans. Math. Softw. 21 (1995), 123-160.

C. Brezinski, A classication of quasi-Newton methods, Numer. Algor. 33 (2003), 123-135.

E.D. Dolan, J.J. More, Benchmarking optimization software with performance proles, Math. Program. 91 (2002), 201-213.

B. Ivanov, P.S. Stanimirović, G.V. Milovanović, S. Djordjević, I. Brajević, Accelerated multiple step-size methods for solving unconstrained optimization problems, Optimization Methods and Software (2019),

J. Nocedal, S.J. Wright, Numerical Optimization, Springer-Verlag New York, Inc, 1999.

J.M. Ortega, W.C. Rheinboldt, Iterative Solution of Nonlinear Equation in Several Variables, Academic Press, New York, London, 1970.

M.J. Petrović, An accelerated Double Step Size method in unconstrained optimization, Applied Math. Comput. 250 (2015), 309-319.

M.J. Petrović, P.S. Stanimirović, Accelerated Double Direction method for solving unconstrained optimization problems, Mathematical Problems in Engineering, 2014 (2014), Article ID 965104, 8 pages.

R.T. Rockafellar, Convex Analysis, Princeton University Press, Princeton, 1970.

Z.-J. Shi, Convergence of line search methods for unconstrained optimization, App. Math. Comput. 157 (2004), 393-405.

P.S. Stanimirovic, M.B. Miladinovic, Accelerated gradient descent methods with line search, Numer. Algor. 54 (2010), 503-520.

P.S. Stanimirović, G.V. Milovanović, M.J. Petrović, A transformation of accelerated double step size method for unconstrained optimization, Mathematical Problems in Engineering, 2015 (2015), Article ID 283679, 8 pages.

W. Sun, Y.-X. Yuan, Optimization theory and methods: nonlinear programming, Springer, Berlin, 2006.



  • There are currently no refbacks.

© University of Niš | Created on November, 2013
ISSN 0352-9665 (Print)
ISSN 2406-047X (Online)