v2010.10.26 - Convex Optimization

788 BIBLIOGRAPHY[10] Farid Alizadeh. Combinatorial Optimization with Interior Point Methods andSemi-Definite Matrices. PhD thesis, University of Minnesota, Computer ScienceDepartment, Minneapolis Minnesota USA, October 1991.[11] Farid Alizadeh. Interior point methods in semidefinite programming withapplications to combinatorial optimization. SIAM Journal on Optimization,5(1):13–51, February 1995.[12] Kurt Anstreicher and Henry Wolkowicz. On Lagrangian relaxation of quadraticmatrix constraints. SIAM Journal on Matrix Analysis and Applications, 22(1):41–55,2000.[13] Howard Anton. Elementary Linear Algebra. Wiley, second edition, 1977.[14] James Aspnes, David Goldenberg, and Yang Richard Yang. On the computationalcomplexity of sensor network localization. In Proceedings of the First InternationalWorkshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS),volume 3121 of Lecture Notes in Computer Science, pages 32–44, Turku Finland,July 2004. Springer-Verlag.cs-www.cs.yale.edu/homes/aspnes/localization-abstract.html[15] D. Avis and K. Fukuda. A pivoting algorithm for convex hulls and vertexenumeration of arrangements and polyhedra. Discrete and Computational Geometry,8:295–313, 1992.[16] Christine Bachoc and Frank Vallentin. New upper bounds for kissing numbersfrom semidefinite programming. Journal of the American Mathematical Society,21(3):909–924, July 2008.http://arxiv.org/abs/math/0608426[17] Mihály Bakonyi and Charles R. Johnson. The Euclidean distance matrix completionproblem. SIAM Journal on Matrix Analysis and Applications, 16(2):646–654, April1995.[18] Keith Ball. An elementary introduction to modern convex geometry. In Silvio Levy,editor, Flavors of Geometry, volume 31, chapter 1, pages 1–58. MSRI Publications,1997.www.msri.org/publications/books/Book31/files/ball.pdf[19] Richard G. Baraniuk. Compressive sensing [lecture notes]. IEEE Signal ProcessingMagazine, 24(4):118–121, July 2007.http://www.convexoptimization.com/TOOLS/GeometryCardinality.pdf[20] George Phillip Barker. Theory of cones. Linear Algebra and its Applications,39:263–291, 1981.[21] George Phillip Barker and David Carlson. Cones of diagonally dominant matrices.Pacific Journal of Mathematics, 57(1):15–32, 1975.[22] George Phillip Barker and James Foran. Self-dual cones in Euclidean spaces. LinearAlgebra and its Applications, 13:147–155, 1976.