v2009.01.01 - Convex Optimization
v2009.01.01 - Convex Optimization v2009.01.01 - Convex Optimization
712 APPENDIX F. NOTATION AND A FEW DEFINITIONS V N V V N (D)= −V T N DV N N ×N symmetric elementary, auxiliary, projector, geometric centering matrix, R(V )= N(1 T ) , N(V )= R(1) , V 2 =V (B.4.1) V N N ×N −1 Schoenberg auxiliary matrix, R(V N )= N(1 T ) , N(VN T )= R(1) (B.4.2) V X V X V T X ≡ V T X T XV (1095) X point list ((68) having cardinality N) arranged columnar in R n×N , or set of generators, or extreme directions, or matrix variable G r n N dom Gram matrix X T X affine dimension Euclidean dimension of list X , or integer cardinality of list X , or integer function domain on function f(x) on A means A is domf , or projection of x on A means A is Euclidean body on which projection of x is made onto epi span function f(x) maps onto M means f over its domain is a surjection with respect to M function epigraph as in spanA = R(A) = {Ax | x∈ R n } when A is a matrix R(A) the subspace: range of A , or span basis R(A) ; R(A) ⊥ N(A T ) basis R(A) columnar basis for range of A , or a minimal set constituting generators for the vertex-description of R(A) , or a linearly independent set of vectors spanning R(A) N(A) the subspace: nullspace of A ; N(A) ⊥ R(A T ) R n Euclidean n-dimensional real vector space, R 0 = 0, R 1 = R (nonnegative integer n)
713 R m×n Euclidean vector space of m by n dimensional real matrices × Cartesian product. R m×n−m = ∆ R m×(n−m) [ ] R m R n R m × R n = R m+n C n or C n×n Euclidean complex vector space of respective dimension n and n×n R n + or R n×n + nonnegative orthant in Euclidean vector space of respective dimension n and n×n R n − or R n×n − S n S n⊥ S n + int S n + S n +(ρ) EDM N √ EDM N PSD SDP SVD SNR nonpositive orthant in Euclidean vector space of respective dimension n and n×n subspace comprising all (real) symmetric n×n matrices, the symmetric matrix subspace orthogonal complement of S n in R n×n , the antisymmetric matrices convex cone comprising all (real) symmetric positive semidefinite n×n matrices, the positive semidefinite cone interior of convex cone comprising all (real) symmetric positive semidefinite n×n matrices; id est, positive definite matrices convex set of all positive semidefinite n×n matrices whose rank equals or exceeds ρ cone of N ×N Euclidean distance matrices in the symmetric hollow subspace nonconvex cone of N ×N Euclidean absolute distance matrices in the symmetric hollow subspace positive semidefinite semidefinite program singular value decomposition signal to noise ratio
- Page 661 and 662: E.6. VECTORIZATION INTERPRETATION,
- Page 663 and 664: E.6. VECTORIZATION INTERPRETATION,
- Page 665 and 666: E.6. VECTORIZATION INTERPRETATION,
- Page 667 and 668: E.6. VECTORIZATION INTERPRETATION,
- Page 669 and 670: E.7. ON VECTORIZED MATRICES OF HIGH
- Page 671 and 672: E.7. ON VECTORIZED MATRICES OF HIGH
- Page 673 and 674: E.8. RANGE/ROWSPACE INTERPRETATION
- Page 675 and 676: E.9. PROJECTION ON CONVEX SET 675 A
- Page 677 and 678: E.9. PROJECTION ON CONVEX SET 677 W
- Page 679 and 680: E.9. PROJECTION ON CONVEX SET 679 P
- Page 681 and 682: E.9. PROJECTION ON CONVEX SET 681 E
- Page 683 and 684: E.9. PROJECTION ON CONVEX SET 683 T
- Page 685 and 686: E.9. PROJECTION ON CONVEX SET 685
- Page 687 and 688: E.10. ALTERNATING PROJECTION 687 E.
- Page 689 and 690: E.10. ALTERNATING PROJECTION 689 b
- Page 691 and 692: E.10. ALTERNATING PROJECTION 691 a
- Page 693 and 694: E.10. ALTERNATING PROJECTION 693 (a
- Page 695 and 696: E.10. ALTERNATING PROJECTION 695 wh
- Page 697 and 698: E.10. ALTERNATING PROJECTION 697 E.
- Page 699 and 700: E.10. ALTERNATING PROJECTION 699 10
- Page 701 and 702: E.10. ALTERNATING PROJECTION 701 E.
- Page 703 and 704: E.10. ALTERNATING PROJECTION 703 E
- Page 705 and 706: Appendix F Notation and a few defin
- Page 707 and 708: 707 a.i. c.i. l.i. w.r.t affinely i
- Page 709 and 710: 709 is or ← → t → 0 + as in
- Page 711: 711 ∑ π(γ) Ξ Π ∏ ψ(Z) D D
- Page 715 and 716: 715 H − H + ∂H ∂H ∂H −
- Page 717 and 718: 717 O O sort-index matrix order of
- Page 719 and 720: (x,y) angle between vectors x and y
- Page 721 and 722: Bibliography [1] Suliman Al-Homidan
- Page 723 and 724: BIBLIOGRAPHY 723 [24] Alexander I.
- Page 725 and 726: BIBLIOGRAPHY 725 [52] Stephen Boyd,
- Page 727 and 728: BIBLIOGRAPHY 727 [78] Frank Critchl
- Page 729 and 730: BIBLIOGRAPHY 729 [105] Richard L. D
- Page 731 and 732: BIBLIOGRAPHY 731 [132] Michel X. Go
- Page 733 and 734: BIBLIOGRAPHY 733 [162] T. Herrmann,
- Page 735 and 736: BIBLIOGRAPHY 735 [191] Mark Kahrs a
- Page 737 and 738: BIBLIOGRAPHY 737 [220] K. V. Mardia
- Page 739 and 740: BIBLIOGRAPHY 739 [250] Pythagoras P
- Page 741 and 742: BIBLIOGRAPHY 741 [277] Anthony Man-
- Page 743 and 744: BIBLIOGRAPHY 743 [306] Michael W. T
- Page 745 and 746: [333] Margaret H. Wright. The inter
- Page 747 and 748: Index 0-norm, 203, 261, 294, 296, 2
- Page 749 and 750: INDEX 749 product, 43, 92, 147, 254
- Page 751 and 752: INDEX 751 coordinates, 140, 170, 17
- Page 753 and 754: INDEX 753 affine dimension, 485 fea
- Page 755 and 756: INDEX 755 affine, 209 nonlinear, 19
- Page 757 and 758: INDEX 757 of point, 37 ray, 90 rela
- Page 759 and 760: INDEX 759 normal, 47, 548, 563 norm
- Page 761 and 762: INDEX 761 strictly, 515, 520 functi
712 APPENDIX F. NOTATION AND A FEW DEFINITIONS<br />
V N<br />
V<br />
V N (D)= −V T N DV N<br />
N ×N symmetric elementary, auxiliary, projector, geometric centering<br />
matrix, R(V )= N(1 T ) , N(V )= R(1) , V 2 =V (B.4.1)<br />
V N N ×N −1 Schoenberg auxiliary matrix, R(V N )= N(1 T ) ,<br />
N(VN T )= R(1) (B.4.2)<br />
V X V X V T X ≡ V T X T XV (1095)<br />
X point list ((68) having cardinality N) arranged columnar in R n×N ,<br />
or set of generators, or extreme directions, or matrix variable<br />
G<br />
r<br />
n<br />
N<br />
dom<br />
Gram matrix X T X<br />
affine dimension<br />
Euclidean dimension of list X , or integer<br />
cardinality of list X , or integer<br />
function domain<br />
on function f(x) on A means A is domf , or projection of x on A<br />
means A is Euclidean body on which projection of x is made<br />
onto<br />
epi<br />
span<br />
function f(x) maps onto M means f over its domain is a surjection<br />
with respect to M<br />
function epigraph<br />
as in spanA = R(A) = {Ax | x∈ R n } when A is a matrix<br />
R(A) the subspace: range of A , or span basis R(A) ; R(A) ⊥ N(A T )<br />
basis R(A)<br />
columnar basis for range of A , or a minimal set constituting generators<br />
for the vertex-description of R(A) , or a linearly independent set of<br />
vectors spanning R(A)<br />
N(A) the subspace: nullspace of A ; N(A) ⊥ R(A T )<br />
R n<br />
Euclidean n-dimensional real vector space, R 0 = 0, R 1 = R<br />
(nonnegative integer n)