v2010.10.26 - Convex Optimization
v2010.10.26 - Convex Optimization v2010.10.26 - Convex Optimization
776 APPENDIX F. NOTATION AND A FEW DEFINITIONS∏ψ(Z)DDD T (X)D(X) TD −1 (X)D(X) −1D ⋆D ∗productsignum-like step function that returns a scalar for matrix argument(708), it returns a vector for vector argument (1579)symmetric hollow matrix of distance-square,or Euclidean distance matrixEuclidean distance matrix operatoradjoint operatortranspose of D(X)inverse operatorinverse of D(X)optimal value of variable Ddual to variable DD ◦ polar variable D∂√d ijd ijpartial derivative or partial differential or matrix of distance-squaresquared (1387) or boundary of set K as in ∂K (17) (24)(absolute) distance scalardistance-square scalar, EDM entryV geometric centering operator, V(D)= −V DV 1 2(996)V N V N (D)= −V T N DV N (1010)VN ×N symmetric elementary, auxiliary, projector, geometric centeringmatrix, 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 (1187)
777X point list ((76) having cardinality N) arranged columnar in R n×N ,or set of generators, or extreme directions, or matrix variableGrkknNinonontooverone-to-oneepidomRfGram matrix X T Xaffine dimensionnumber of conically independent generatorsraw-data domain of Magnetic Resonance Imaging machine as in k-spaceEuclidean (ambient spatial) dimension of list X ∈ R n×N , or integercardinality of list X ∈ R n×N , or integerfunction f in x means x as argument to for x in C means element x is a member of set Cfunction f(x) on A means A is domfor relation ≼ on A means A is set whose elements are subject to ≼or projection of x on A means A is body on which projection is madeor operating on vector identifies argument type to f as “vector”function f(x) maps onto M means f over its domain is a surjectionwith respect to Mfunction f(x) over C means f evaluated at each and every element ofset Cinjective map or unique correspondence between setsfunction epigraphfunction domainfunction rangeR(A) the subspace: range of A , or span basis R(A) ; R(A) ⊥ N(A T )spanbasis R(A)as in spanA = R(A) = {Ax | x∈ R n } when A is a matrixovercomplete columnar basis for range of Aor minimal set constituting generators for vertex-description of R(A)or linearly independent set of vectors spanning R(A)
- Page 725 and 726: E.6. VECTORIZATION INTERPRETATION,
- Page 727 and 728: E.6. VECTORIZATION INTERPRETATION,
- Page 729 and 730: E.7. PROJECTION ON MATRIX SUBSPACES
- Page 731 and 732: E.7. PROJECTION ON MATRIX SUBSPACES
- Page 733 and 734: E.8. RANGE/ROWSPACE INTERPRETATION
- Page 735 and 736: E.9. PROJECTION ON CONVEX SET 735As
- Page 737 and 738: E.9. PROJECTION ON CONVEX SET 737Wi
- Page 739 and 740: E.9. PROJECTION ON CONVEX SET 739R(
- Page 741 and 742: E.9. PROJECTION ON CONVEX SET 741E.
- Page 743 and 744: E.9. PROJECTION ON CONVEX SET 743E.
- Page 745 and 746: E.9. PROJECTION ON CONVEX SET 745Un
- Page 747 and 748: E.9. PROJECTION ON CONVEX SET 747ac
- Page 749 and 750: E.10. ALTERNATING PROJECTION 749bC
- Page 751 and 752: E.10. ALTERNATING PROJECTION 7510
- Page 753 and 754: E.10. ALTERNATING PROJECTION 753E.1
- Page 755 and 756: E.10. ALTERNATING PROJECTION 755y 2
- Page 757 and 758: E.10. ALTERNATING PROJECTION 757Def
- Page 759 and 760: E.10. ALTERNATING PROJECTION 759Dis
- Page 761 and 762: E.10. ALTERNATING PROJECTION 761mat
- Page 763 and 764: E.10. ALTERNATING PROJECTION 763K
- Page 765 and 766: E.10. ALTERNATING PROJECTION 765E.1
- Page 767 and 768: E.10. ALTERNATING PROJECTION 767E.1
- Page 769 and 770: Appendix FNotation and a few defini
- Page 771 and 772: 771A ij or A(i, j) , ij th entry of
- Page 773 and 774: 773⊞orthogonal vector sum of sets
- Page 775: 775x +vector x whose negative entri
- Page 779 and 780: 779SDPSVDSNRdBEDMS n 1S n hS n⊥hS
- Page 781 and 782: 781vectorentrycubixquartixfeasible
- Page 783 and 784: 783Oorder of magnitude information
- Page 785 and 786: 785cofmatrix of cofactors correspon
- Page 787 and 788: Bibliography[1] Edwin A. Abbott. Fl
- Page 789 and 790: BIBLIOGRAPHY 789[23] Dror Baron, Mi
- Page 791 and 792: BIBLIOGRAPHY 791[49] Leonard M. Blu
- Page 793 and 794: BIBLIOGRAPHY 793[74] Yves Chabrilla
- Page 795 and 796: BIBLIOGRAPHY 795[102] Etienne de Kl
- Page 797 and 798: BIBLIOGRAPHY 797[129] Carl Eckart a
- Page 799 and 800: BIBLIOGRAPHY 799[154] James Gleik.
- Page 801 and 802: BIBLIOGRAPHY 801[182] Johan Håstad
- Page 803 and 804: BIBLIOGRAPHY 803[212] Viren Jain an
- Page 805 and 806: BIBLIOGRAPHY 805[237] Monique Laure
- Page 807 and 808: BIBLIOGRAPHY 807[265] Sunderarajan
- Page 809 and 810: BIBLIOGRAPHY 809Notes in Computer S
- Page 811 and 812: BIBLIOGRAPHY 811[319] Anthony Man-C
- Page 813 and 814: BIBLIOGRAPHY 813[346] Pham Dinh Tao
- Page 815 and 816: BIBLIOGRAPHY 815[375] Bernard Widro
- Page 817 and 818: Index∅, see empty set0-norm, 229,
- Page 819 and 820: INDEX 819bees, 30, 413Bellman, 276b
- Page 821 and 822: INDEX 821circular, 130construction,
- Page 823 and 824: INDEX 823measure, 295convex, 21, 36
- Page 825 and 826: INDEX 825duality, 160, 410gap, 161,
777X point list ((76) having cardinality N) arranged columnar in R n×N ,or set of generators, or extreme directions, or matrix variableGrkknNinonontooverone-to-oneepidomRfGram matrix X T Xaffine dimensionnumber of conically independent generatorsraw-data domain of Magnetic Resonance Imaging machine as in k-spaceEuclidean (ambient spatial) dimension of list X ∈ R n×N , or integercardinality of list X ∈ R n×N , or integerfunction f in x means x as argument to for x in C means element x is a member of set Cfunction f(x) on A means A is domfor relation ≼ on A means A is set whose elements are subject to ≼or projection of x on A means A is body on which projection is madeor operating on vector identifies argument type to f as “vector”function f(x) maps onto M means f over its domain is a surjectionwith respect to Mfunction f(x) over C means f evaluated at each and every element ofset Cinjective map or unique correspondence between setsfunction epigraphfunction domainfunction rangeR(A) the subspace: range of A , or span basis R(A) ; R(A) ⊥ N(A T )spanbasis R(A)as in spanA = R(A) = {Ax | x∈ R n } when A is a matrixovercomplete columnar basis for range of Aor minimal set constituting generators for vertex-description of R(A)or linearly independent set of vectors spanning R(A)