v2009.01.01 - Convex Optimization
v2009.01.01 - Convex Optimization v2009.01.01 - Convex Optimization
736 BIBLIOGRAPHY [206] Monique Laurent and Franz Rendl. Semidefinite programming and integer programming. Optimization Online, 2002. http://www.optimization-online.org/DB HTML/2002/12/585.html [207] Monique Laurent and Franz Rendl. Semidefinite programming and integer programming. In K. Aardal, George L. Nemhauser, and R. Weismantel, editors, Discrete Optimization, volume 12 of Handbooks in Operations Research and Management Science, chapter 8, pages 393–514. Elsevier, 2005. [208] Charles L. Lawson and Richard J. Hanson. Solving Least Squares Problems. SIAM, 1995. [209] Jung Rye Lee. The law of cosines in a tetrahedron. Journal of the Korea Society of Mathematical Education Series B: The Pure and Applied Mathematics, 4(1):1–6, 1997. [210] Vladimir L. Levin. Quasi-convex functions and quasi-monotone operators. Journal of Convex Analysis, 2(1/2):167–172, 1995. [211] Scott Nathan Levine. Audio Representations for Data Compression and Compressed Domain Processing. PhD thesis, Stanford University, Department of Electrical Engineering, 1999. http://www-ccrma.stanford.edu/∼scottl/thesis/thesis.pdf [212] Adrian S. Lewis. Eigenvalue-constrained faces. Linear Algebra and its Applications, 269:159–181, 1998. [213] Anhua Lin. Projection algorithms in nonlinear programming. PhD thesis, Johns Hopkins University, 2003. [214] Miguel Sousa Lobo, Lieven Vandenberghe, Stephen Boyd, and Hervé Lebret. Applications of second-order cone programming. Linear Algebra and its Applications, 284:193–228, November 1998. Special Issue on Linear Algebra in Control, Signals and Image Processing. http://www.stanford.edu/∼boyd/socp.html [215] David G. Luenberger. Optimization by Vector Space Methods. Wiley, 1969. [216] David G. Luenberger. Introduction to Dynamic Systems: Theory, Models, & Applications. Wiley, 1979. [217] David G. Luenberger. Linear and Nonlinear Programming. Addison-Wesley, second edition, 1989. [218] Zhi-Quan Luo, Jos F. Sturm, and Shuzhong Zhang. Superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming. SIAM Journal on Optimization, 8(1):59–81, 1998. [219] Zhi-Quan Luo and Wei Yu. An introduction to convex optimization for communications and signal processing. IEEE Journal On Selected Areas In Communications, 24(8):1426–1438, August 2006.
BIBLIOGRAPHY 737 [220] K. V. Mardia. Some properties of classical multi-dimensional scaling. Communications in Statistics: Theory and Methods, A7(13):1233–1241, 1978. [221] K. V. Mardia, J. T. Kent, and J. M. Bibby. Multivariate Analysis. Academic Press, 1979. [222] Jerrold E. Marsden and Michael J. Hoffman. Elementary Classical Analysis. Freeman, second edition, 1995. [223] Rudolf Mathar. The best Euclidean fit to a given distance matrix in prescribed dimensions. Linear Algebra and its Applications, 67:1–6, 1985. [224] Rudolf Mathar. Multidimensionale Skalierung. B. G. Teubner Stuttgart, 1997. [225] Nathan S. Mendelsohn and A. Lloyd Dulmage. The convex hull of sub-permutation matrices. Proceedings of the American Mathematical Society, 9(2):253–254, April 1958. http://www.convexoptimization.com/TOOLS/permu.pdf [226] Mehran Mesbahi and G. P. Papavassilopoulos. On the rank minimization problem over a positive semi-definite linear matrix inequality. IEEE Transactions on Automatic Control, 42(2):239–243, 1997. [227] Mehran Mesbahi and G. P. Papavassilopoulos. Solving a class of rank minimization problems via semi-definite programs, with applications to the fixed order output feedback synthesis. In Proceedings of the American Control Conference, volume 1, pages 77–80. American Automatic Control Council (AACC), June 1997. [228] Sunderarajan S. Mohan, Mar Hershenson, Stephen Boyd, and Thomas Lee. Simple accurate expressions for planar spiral inductances. IEEE Journal of Solid-State Circuits, 1999. [229] Sunderarajan S. Mohan, Mar Hershenson, Stephen Boyd, and Thomas Lee. Bandwidth extension in CMOS with optimized on-chip inductors. IEEE Journal of Solid-State Circuits, 2000. [230] E. H. Moore. On the reciprocal of the general algebraic matrix. Bulletin of the American Mathematical Society, 26:394–395, 1920. Abstract. [231] B. S. Mordukhovich. Maximum principle in the problem of time optimal response with nonsmooth constraints. Journal of Applied Mathematics and Mechanics, 40:960–969, 1976. [232] Jean-Jacques Moreau. Décomposition orthogonale d’un espace Hilbertien selon deux cônes mutuellement polaires. Comptes Rendus de l’Académie des Sciences, Paris, 255:238–240, 1962. [233] T. S. Motzkin and I. J. Schoenberg. The relaxation method for linear inequalities. Canadian Journal of Mathematics, 6:393–404, 1954. [234] Neil Muller, Lourenço Magaia, and B. M. Herbst. Singular value decomposition, eigenfaces, and 3D reconstructions. SIAM Review, 46(3):518–545, September 2004.
- 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 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: BIBLIOGRAPHY 735 [191] Mark Kahrs a
- 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
- 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
736 BIBLIOGRAPHY<br />
[206] Monique Laurent and Franz Rendl. Semidefinite programming and integer<br />
programming. <strong>Optimization</strong> Online, 2002.<br />
http://www.optimization-online.org/DB HTML/2002/12/585.html<br />
[207] Monique Laurent and Franz Rendl. Semidefinite programming and integer<br />
programming. In K. Aardal, George L. Nemhauser, and R. Weismantel, editors,<br />
Discrete <strong>Optimization</strong>, volume 12 of Handbooks in Operations Research and<br />
Management Science, chapter 8, pages 393–514. Elsevier, 2005.<br />
[208] Charles L. Lawson and Richard J. Hanson. Solving Least Squares Problems. SIAM,<br />
1995.<br />
[209] Jung Rye Lee. The law of cosines in a tetrahedron. Journal of the Korea Society<br />
of Mathematical Education Series B: The Pure and Applied Mathematics, 4(1):1–6,<br />
1997.<br />
[210] Vladimir L. Levin. Quasi-convex functions and quasi-monotone operators. Journal<br />
of <strong>Convex</strong> Analysis, 2(1/2):167–172, 1995.<br />
[211] Scott Nathan Levine. Audio Representations for Data Compression and Compressed<br />
Domain Processing. PhD thesis, Stanford University, Department of Electrical<br />
Engineering, 1999.<br />
http://www-ccrma.stanford.edu/∼scottl/thesis/thesis.pdf<br />
[212] Adrian S. Lewis. Eigenvalue-constrained faces. Linear Algebra and its Applications,<br />
269:159–181, 1998.<br />
[213] Anhua Lin. Projection algorithms in nonlinear programming. PhD thesis, Johns<br />
Hopkins University, 2003.<br />
[214] Miguel Sousa Lobo, Lieven Vandenberghe, Stephen Boyd, and Hervé Lebret.<br />
Applications of second-order cone programming. Linear Algebra and its<br />
Applications, 284:193–228, November 1998. Special Issue on Linear Algebra<br />
in Control, Signals and Image Processing.<br />
http://www.stanford.edu/∼boyd/socp.html<br />
[215] David G. Luenberger. <strong>Optimization</strong> by Vector Space Methods. Wiley, 1969.<br />
[216] David G. Luenberger. Introduction to Dynamic Systems: Theory, Models, &<br />
Applications. Wiley, 1979.<br />
[217] David G. Luenberger. Linear and Nonlinear Programming. Addison-Wesley, second<br />
edition, 1989.<br />
[218] Zhi-Quan Luo, Jos F. Sturm, and Shuzhong Zhang. Superlinear convergence of<br />
a symmetric primal-dual path following algorithm for semidefinite programming.<br />
SIAM Journal on <strong>Optimization</strong>, 8(1):59–81, 1998.<br />
[219] Zhi-Quan Luo and Wei Yu. An introduction to convex optimization for<br />
communications and signal processing. IEEE Journal On Selected Areas In<br />
Communications, 24(8):1426–1438, August 2006.
Change language