@article{(Open Science Index):https://publications.waset.org/pdf/10002037,
	  title     = {Steepest Descent Method with New Step Sizes},
	  author    = {Bib Paruhum Silalahi and  Djihad Wungguli and  Sugi Guritman},
	  country	= {},
	  institution	= {},
	  abstract     = {Steepest descent method is a simple gradient method
for optimization. This method has a slow convergence in heading to
the optimal solution, which occurs because of the zigzag form of the
steps. Barzilai and Borwein modified this algorithm so that it
performs well for problems with large dimensions. Barzilai and
Borwein method results have sparked a lot of research on the method
of steepest descent, including alternate minimization gradient method
and Yuan method. Inspired by previous works, we modified the step
size of the steepest descent method. We then compare the
modification results against the Barzilai and Borwein method,
alternate minimization gradient method and Yuan method for
quadratic function cases in terms of the iterations number and the
running time. The average results indicate that the steepest descent
method with the new step sizes provide good results for small
dimensions and able to compete with the results of Barzilai and
Borwein method and the alternate minimization gradient method for
large dimensions. The new step sizes have faster convergence
compared to the other methods, especially for cases with large
dimensions.},
	    journal   = {International Journal of Mathematical and Computational Sciences},
	  volume    = {9},
	  number    = {7},
	  year      = {2015},
	  pages     = {378 - 384},
	  ee        = {https://publications.waset.org/pdf/10002037},
	  url   	= {https://publications.waset.org/vol/103},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 103, 2015},
	}