10.03.2015 Views

v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

626 APPENDIX D. MATRIX CALCULUS<br />

In the case g(X) : R K →R has vector argument, they further simplify:<br />

→Y<br />

dg(X) = ∇g(X) T Y (1711)<br />

and so on.<br />

→Y<br />

dg 2 (X) = Y T ∇ 2 g(X)Y (1712)<br />

→Y<br />

dg 3 (X) = ∇ X<br />

(<br />

Y T ∇ 2 g(X)Y ) T<br />

Y (1713)<br />

D.1.7<br />

Taylor series<br />

Series expansions of the differentiable matrix-valued function g(X) , of<br />

matrix argument, were given earlier in (1685) and (1706). Assuming g(X)<br />

has continuous first-, second-, and third-order gradients over the open set<br />

domg , then for X ∈ dom g and any Y ∈ R K×L the complete Taylor series<br />

on some open interval of µ∈R is expressed<br />

g(X+µY ) = g(X) + µ dg(X) →Y<br />

+ 1 →Y<br />

µ2dg 2 (X) + 1 →Y<br />

µ3dg 3 (X) + o(µ 4 ) (1714)<br />

2! 3!<br />

or on some open interval of ‖Y ‖ 2<br />

g(Y ) = g(X) +<br />

→Y −X<br />

→Y −X<br />

→Y −X<br />

dg(X) + 1 dg 2 (X) + 1 dg 3 (X) + o(‖Y ‖ 4 ) (1715)<br />

2! 3!<br />

which are third-order expansions about X . The mean value theorem from<br />

calculus is what insures finite order of the series. [190] [37,1.1] [36, App.A.5]<br />

[173,0.4]<br />

D.1.7.0.1 Example. Inverse matrix function.<br />

Say g(Y )= Y −1 . Let’s find its Taylor series expansion about X = I .<br />

Continuing the table on page 632,<br />

→Y<br />

dg(X) = d dt∣ g(X+ t Y ) = −X −1 Y X −1 (1716)<br />

t=0<br />

→Y<br />

dg 2 (X) = d2<br />

dt 2 ∣<br />

∣∣∣t=0<br />

g(X+ t Y ) = 2X −1 Y X −1 Y X −1 (1717)<br />

→Y<br />

dg 3 (X) = d3<br />

dt 3 ∣<br />

∣∣∣t=0<br />

g(X+ t Y ) = −6X −1 Y X −1 Y X −1 Y X −1 (1718)

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!