v2007.09.13 - Convex Optimization

Appendix GNotation and a few definitionsbb ib i:jb k (i:j)b Tb HA −2TA T 1vector, scalar, logical condition (italic abcdefghijklmnopqrstuvwxyz)i th entry of vector b=[b i , i=1... n] or i th b vector from a set or list{b j , j =1... n} or i th iterate of vector bor b(i:j) , truncated vector comprising i th through j th entry of vector btruncated vector comprising i th through j th entry of vector b kvector transposeHermitian (conjugate) transposematrix transpose of squared inversefirst of various transpositions of a cubix or quartix AAskinnymatrix, scalar, or logical condition(italic ABCDEFGHIJKLMNOPQRSTUV WXY Z)⎡a skinny matrix; meaning, more rows than columns: ⎣⎤⎦. Whenthere are more equations than unknowns, we say that the system Ax = bis overdetermined. [109,5.3]fat a fat matrix; meaning, more columns than rows:[ ]underdetermined2001 Jon Dattorro. CO&EDG version 2007.09.13. All rights reserved.Citation: Jon Dattorro, Convex Optimization & Euclidean Distance Geometry,Meboo Publishing USA, 2005.671