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.

718 APPENDIX F. NOTATION AND A FEW DEFINITIONS<br />

int<br />

lim<br />

sgn<br />

round<br />

mod<br />

tr<br />

rank<br />

interior<br />

limit<br />

signum function or sign<br />

round to nearest integer<br />

modulus function<br />

matrix trace<br />

as in rankA, rank of matrix A ; dim R(A)<br />

dim dimension, dim R n = n , dim(x∈ R n ) = n , dim R(x∈ R n ) = 1,<br />

dim R(A∈ R m×n )= rank(A)<br />

aff<br />

dim aff<br />

affine hull<br />

affine dimension<br />

card cardinality, number of nonzero entries cardx ∆ = ‖x‖ 0<br />

or N is cardinality of list X ∈ R n×N (p.287)<br />

conv<br />

cenv<br />

cone<br />

content<br />

cof<br />

convex hull<br />

convex envelope<br />

conic hull<br />

of high-dimensional bounded polyhedron, volume in 3 dimensions, area<br />

in 2, and so on<br />

matrix of cofactors corresponding to matrix argument<br />

dist distance between point or set arguments; e.g., dist(x, B)<br />

vec vectorization of m ×n matrix, Euclidean dimension mn (30)<br />

svec vectorization of symmetric n ×n matrix, Euclidean dimension<br />

n(n + 1)/2 (49)<br />

dvec<br />

vectorization of symmetric hollow n ×n matrix, Euclidean dimension<br />

n(n − 1)/2 (66)

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

Saved successfully!

Ooh no, something went wrong!