Dear Muhammad, you can have a look to the following presentation:

https://www.cs.cmu.edu/~ggordon/10725-F12/slides/09-acceleration.pdf

Hi,

I think the following paper may be interesting for you

https://arxiv.org/pdf/1506.08187.pdf

It describes a geometric alternative to the Nesterov's approach

Geometric alternatives of Nesterov's method also require the strongly convex of objective function. However, I think BB method may be a suitable alternative.

You can use conjugate gradient method or three term conjugate gradient method.

There is the heavy ball method of [Polyak, 1964].

Here is the original paper https://www.researchgate.net/profile/Boris_Polyak2/publication/243648538_Some_methods_of_speeding_up_the_convergence_of_iteration_methods/links/5666fa3808ae34c89a01fda1.pdf?origin=publication_detail

and some more recent descriprion

http://web.stanford.edu/class/msande318/notes/notes-first-order-smooth.pdf

At the same time, recently there has been proposed several accelerated methods for finite-sum minimization

https://arxiv.org/pdf/1409.3257v2.pdf

http://pwp.gatech.edu/guanghui-lan/wp-content/uploads/sites/330/2016/02/OptRandom10-18.pdf

https://arxiv.org/pdf/1309.2375v2.pdf

https://arxiv.org/abs/1603.05953

Also this paper could be interesting

https://statweb.stanford.edu/~candes/papers/NIPS2014.pdf

Article Some methods of speeding up the convergence of iteration methods