v2009.01.01 - Convex Optimization
v2009.01.01 - Convex Optimization v2009.01.01 - Convex Optimization
742 BIBLIOGRAPHY [292] Jos F. Sturm and Shuzhong Zhang. On cones of nonnegative quadratic functions. Optimization Online, April 2001. www.optimization-online.org/DB HTML/2001/05/324.html [293] George P. H. Styan. A review and some extensions of Takemura’s generalizations of Cochran’s theorem. Technical Report 56, Stanford University, Department of Statistics, September 1982. [294] George P. H. Styan and Akimichi Takemura. Rank additivity and matrix polynomials. Technical Report 57, Stanford University, Department of Statistics, September 1982. [295] Jun Sun, Stephen Boyd, Lin Xiao, and Persi Diaconis. The fastest mixing Markov process on a graph and a connection to a maximum variance unfolding problem. SIAM Review, 48(4):681–699, December 2006. [296] Chen Han Sung and Bit-Shun Tam. A study of projectionally exposed cones. Linear Algebra and its Applications, 139:225–252, 1990. [297] Yoshio Takane. On the relations among four methods of multidimensional scaling. Behaviormetrika, 4:29–43, 1977. http://takane.brinkster.net/Yoshio/p008.pdf [298] Akimichi Takemura. On generalizations of Cochran’s theorem and projection matrices. Technical Report 44, Stanford University, Department of Statistics, August 1980. [299] Dharmpal Takhar, Jason N. Laska, Michael B. Wakin, Marco F. Duarte, Dror Baron, Shriram Sarvotham, Kevin F. Kelly, and Richard G. Baraniuk. A new compressive imaging camera architecture using optical-domain compression. In Proceedings of SPIE Conference on Computational Imaging IV, volume 6065, February 2006. http://www.dsp.rice.edu/cs/cscam-SPIEJan06.pdf [300] Peng Hui Tan and Lars K. Rasmussen. The application of semidefinite programming for detection in CDMA. IEEE Journal on Selected Areas in Communications, 19(8), August 2001. [301] Pablo Tarazaga. Faces of the cone of Euclidean distance matrices: Characterizations, structure and induced geometry. Linear Algebra and its Applications, 408:1–13, 2005. [302] Warren S. Torgerson. Theory and Methods of Scaling. Wiley, 1958. [303] Lloyd N. Trefethen and David Bau, III. Numerical Linear Algebra. SIAM, 1997. [304] Michael W. Trosset. Applications of multidimensional scaling to molecular conformation. Computing Science and Statistics, 29:148–152, 1998. [305] Michael W. Trosset. Distance matrix completion by numerical optimization. Computational Optimization and Applications, 17(1):11–22, October 2000.
BIBLIOGRAPHY 743 [306] Michael W. Trosset. Extensions of classical multidimensional scaling: Computational theory. www.math.wm.edu/∼trosset/r.mds.html , 2001. Revision of technical report entitled “Computing distances between convex sets and subsets of the positive semidefinite matrices” first published in 1997. [307] Michael W. Trosset and Rudolf Mathar. On the existence of nonglobal minimizers of the STRESS criterion for metric multidimensional scaling. In Proceedings of the Statistical Computing Section, pages 158–162. American Statistical Association, 1997. [308] Joshua Trzasko and Armando Manduca. Highly undersampled magnetic resonance image reconstruction via homotopic l 0 -minimization. IEEE Transactions on Medical Imaging, 28(1):106–121, January 2009. www.convexoptimization.com/TOOLS/SparseRecon.pdf (October 2007 DRAFT). [309] Joshua Trzasko, Armando Manduca, and Eric Borisch. Sparse MRI reconstruction via multiscale L 0 -continuation. In Proceedings of the IEEE 14 th Workshop on Statistical Signal Processing, pages 176–180, August 2007. http://www.convexoptimization.com/TOOLS/L0MRI.pdf [310] P. P. Vaidyanathan. Multirate Systems and Filter Banks. Prentice-Hall, 1993. [311] Jan van Tiel. Convex Analysis, an Introductory Text. Wiley, 1984. [312] Lieven Vandenberghe and Stephen Boyd. Semidefinite programming. SIAM Review, 38(1):49–95, March 1996. [313] Lieven Vandenberghe and Stephen Boyd. Connections between semi-infinite and semidefinite programming. In R. Reemtsen and J.-J. Rückmann, editors, Semi-Infinite Programming, chapter 8, pages 277–294. Kluwer Academic Publishers, 1998. [314] Lieven Vandenberghe and Stephen Boyd. Applications of semidefinite programming. Applied Numerical Mathematics, 29(3):283–299, March 1999. [315] Lieven Vandenberghe, Stephen Boyd, and Shao-Po Wu. Determinant maximization with linear matrix inequality constraints. SIAM Journal on Matrix Analysis and Applications, 19(2):499–533, April 1998. [316] Robert J. Vanderbei. Convex optimization: Interior-point methods and applications, 1999. http://orfe.princeton.edu/∼rvdb/pdf/talks/pumath/talk.pdf [317] Richard S. Varga. Geršgorin and His Circles. Springer-Verlag, 2004. [318] Martin Vetterli and Jelena Kovačević. Wavelets and Subband Coding. Prentice-Hall, 1995. [319] Martin Vetterli, Pina Marziliano, and Thierry Blu. Sampling signals with finite rate of innovation. IEEE Transactions on Signal Processing, 50(6):1417–1428, June 2002. http://bigwww.epfl.ch/publications/vetterli0201.pdf http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.5630
- 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 and 712: 711 ∑ π(γ) Ξ Π ∏ ψ(Z) D D
- Page 713 and 714: 713 R m×n Euclidean vector space o
- 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: BIBLIOGRAPHY 741 [277] Anthony Man-
- 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
- Page 763 and 764: INDEX 763 vector, 45, 241, 248, 325
- Page 765 and 766: INDEX 765 convex envelope, see conv
- Page 767 and 768: INDEX 767 cone, 418, 420, 507 dual,
- Page 769 and 770: INDEX 769 trilateration, 21, 42, 36
- Page 772: Convex Optimization & Euclidean Dis
742 BIBLIOGRAPHY<br />
[292] Jos F. Sturm and Shuzhong Zhang. On cones of nonnegative quadratic functions.<br />
<strong>Optimization</strong> Online, April 2001.<br />
www.optimization-online.org/DB HTML/2001/05/324.html<br />
[293] George P. H. Styan. A review and some extensions of Takemura’s generalizations<br />
of Cochran’s theorem. Technical Report 56, Stanford University, Department of<br />
Statistics, September 1982.<br />
[294] George P. H. Styan and Akimichi Takemura. Rank additivity and matrix<br />
polynomials. Technical Report 57, Stanford University, Department of Statistics,<br />
September 1982.<br />
[295] Jun Sun, Stephen Boyd, Lin Xiao, and Persi Diaconis. The fastest mixing Markov<br />
process on a graph and a connection to a maximum variance unfolding problem.<br />
SIAM Review, 48(4):681–699, December 2006.<br />
[296] Chen Han Sung and Bit-Shun Tam. A study of projectionally exposed cones. Linear<br />
Algebra and its Applications, 139:225–252, 1990.<br />
[297] Yoshio Takane. On the relations among four methods of multidimensional scaling.<br />
Behaviormetrika, 4:29–43, 1977.<br />
http://takane.brinkster.net/Yoshio/p008.pdf<br />
[298] Akimichi Takemura. On generalizations of Cochran’s theorem and projection<br />
matrices. Technical Report 44, Stanford University, Department of Statistics,<br />
August 1980.<br />
[299] Dharmpal Takhar, Jason N. Laska, Michael B. Wakin, Marco F. Duarte, Dror<br />
Baron, Shriram Sarvotham, Kevin F. Kelly, and Richard G. Baraniuk. A new<br />
compressive imaging camera architecture using optical-domain compression. In<br />
Proceedings of SPIE Conference on Computational Imaging IV, volume 6065,<br />
February 2006.<br />
http://www.dsp.rice.edu/cs/cscam-SPIEJan06.pdf<br />
[300] Peng Hui Tan and Lars K. Rasmussen. The application of semidefinite programming<br />
for detection in CDMA. IEEE Journal on Selected Areas in Communications, 19(8),<br />
August 2001.<br />
[301] Pablo Tarazaga. Faces of the cone of Euclidean distance matrices: Characterizations,<br />
structure and induced geometry. Linear Algebra and its Applications, 408:1–13, 2005.<br />
[302] Warren S. Torgerson. Theory and Methods of Scaling. Wiley, 1958.<br />
[303] Lloyd N. Trefethen and David Bau, III. Numerical Linear Algebra. SIAM, 1997.<br />
[304] Michael W. Trosset. Applications of multidimensional scaling to molecular<br />
conformation. Computing Science and Statistics, 29:148–152, 1998.<br />
[305] Michael W. Trosset. Distance matrix completion by numerical optimization.<br />
Computational <strong>Optimization</strong> and Applications, 17(1):11–22, October 2000.
Change language