The Steepest Descent Algorithm for Unconstrained Optimization and ...
The Steepest Descent Algorithm for Unconstrained Optimization and ...
The Steepest Descent Algorithm for Unconstrained Optimization and ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
5 x 2 +4 y 2 +3 x y+7 x+20<br />
1200<br />
1000<br />
800<br />
600<br />
400<br />
200<br />
0<br />
10<br />
5<br />
y<br />
0<br />
−5<br />
−10<br />
−10<br />
−5<br />
x<br />
0<br />
5<br />
10<br />
Figure 1: <strong>The</strong> contours of a convex quadratic function are ellipsoids.<br />
4.2 Example 2: Hem-Stitching<br />
Consider the function<br />
f(x) = 1 2 xT Qx − c T x +10<br />
where Q <strong>and</strong> c are given by:<br />
<strong>and</strong><br />
Q =<br />
c =<br />
(<br />
20 5<br />
5 2<br />
(<br />
14<br />
6<br />
)<br />
)<br />
10
Change language