Example: marketing
The Steepest Descent Algorithm for ... - MIT OpenCourseWare
the optimal solution x = x∗ .In order to see how this arises, we will exam-ine the case where the objective function f (x) is itself a simple quadratic function of the form: f (x)= 1 x T Qx + q T x, 2 where Q is a positive definite symmetric matrix. We will suppose that the
Download The Steepest Descent Algorithm for ... - MIT OpenCourseWare
Information
Domain:
Source:
Link to this page: