The classical steepest descent (SD) method is known as one of the earliest and the best method to minimize a function. Even though the convergence rate is quite slow, but its simplicity has made it one of the easiest methods to be used and applied especially in the form of computer codes. In this paper, a new modification of SD method is proposed using a new search direction (dk) in the form of two parameters. Numerical results shows that this new SD has far superior convergence rate and more efficient than the classical SD method.