Steepest descent method optimization | Multi-variable Unconstrained | Cauchy's Method | Lec 4|

In this video session we have applied steepest descent method to solve an unconstrained optimization problem.

#steepestdescentmethod#nonlinearprogramming#makaut#unconstrainedoptimization

In mathematics, the method of steepest descent or stationary-phase method or saddle-point method is an extension of Laplace's method for approximating an integral, where one deforms a contour integral in the complex plane to pass near a stationary point (saddle point), in roughly the direction of steepest descent or stationary phase. The saddle-point approximation is used with integrals in the complex plane, whereas Laplace’s method is used with real integrals.

The method of steepest descent was first published by Debye (1909), who used it to estimate Bessel functions and pointed out that it occurred in the unpublished note by Riemann (1863) about hypergeometric functions. The contour of steepest descent has a minimax property, [Fedoryuk (2001)]. Siegel (1932) described some other unpublished notes of Riemann, where he used this method to derive the Riemann–Siegel formula.

If this video seems to be helpful to you than subscribe to our channel for more updates and Share it to your friends.

For full playlist of Queuing Theory click below at:

For full playlist of Operation Research click below at: