v2010.10.26 - Convex Optimization
Share Embed Flag
Download ePaper

v2010.10.26 - Convex Optimization

v2010.10.26 - Convex Optimization v2010.10.26 - Convex Optimization

convexoptimization.com
from convexoptimization.com More from this publisher
12.07.2015 Views

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.

BIBLIOGRAPHY 789[23] Dror Baron, Michael B. Wakin, Marco F. Duarte, Shriram Sarvotham, andRichard G. Baraniuk. Distributed compressed sensing. Technical Report ECE-0612,Rice University, Electrical and Computer Engineering Department, December 2006.http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.4789[24] Alexander I. Barvinok. Problems of distance geometry and convex properties ofquadratic maps. Discrete & Computational Geometry, 13(2):189–202, 1995.[25] Alexander I. Barvinok. A remark on the rank of positive semidefinite matricessubject to affine constraints. Discrete & Computational Geometry, 25(1):23–31,2001.http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.4627[26] Alexander I. Barvinok. A Course in Convexity. American Mathematical Society,2002.[27] Alexander I. Barvinok. Approximating orthogonal matrices by permutationmatrices. Pure and Applied Mathematics Quarterly, 2:943–961, 2006.[28] Heinz H. Bauschke and Jonathan M. Borwein. On projection algorithms for solvingconvex feasibility problems. SIAM Review, 38(3):367–426, September 1996.[29] Steven R. Bell. The Cauchy Transform, Potential Theory, and Conformal Mapping.CRC Press, 1992.[30] Jean Bellissard and Bruno Iochum. Homogeneous and facially homogeneous self-dualcones. Linear Algebra and its Applications, 19:1–16, 1978.[31] Richard Bellman and Ky Fan. On systems of linear inequalities in Hermitianmatrix variables. In Victor L. Klee, editor, Convexity, volume VII of Proceedings ofSymposia in Pure Mathematics, pages 1–11. American Mathematical Society, 1963.[32] Adi Ben-Israel. Linear equations and inequalities on finite dimensional, real orcomplex, vector spaces: A unified theory. Journal of Mathematical Analysis andApplications, 27:367–389, 1969.[33] Adi Ben-Israel. Motzkin’s transposition theorem, and the related theorems ofFarkas, Gordan and Stiemke. In Michiel Hazewinkel, editor, Encyclopaedia ofMathematics. Springer-Verlag, 2001.http://www.convexoptimization.com/TOOLS/MOTZKIN.pdf[34] Aharon Ben-Tal and Arkadi Nemirovski. Lectures on Modern Convex Optimization:Analysis, Algorithms, and Engineering Applications. SIAM, 2001.[35] Aharon Ben-Tal and Arkadi Nemirovski. Non-Euclidean restricted memorylevel method for large-scale convex optimization. Mathematical Programming,102(3):407–456, January 2005.http://www2.isye.gatech.edu/~nemirovs/Bundle-Mirror rev fin.pdf[36] John J. Benedetto and Paulo J.S.G. Ferreira editors. Modern Sampling Theory:Mathematics and Applications. Birkhäuser, 2001.

BIBLIOGRAPHY 789[23] Dror Baron, Michael B. Wakin, Marco F. Duarte, Shriram Sarvotham, andRichard G. Baraniuk. Distributed compressed sensing. Technical Report ECE-0612,Rice University, Electrical and Computer Engineering Department, December 2006.http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.4789[24] Alexander I. Barvinok. Problems of distance geometry and convex properties ofquadratic maps. Discrete & Computational Geometry, 13(2):189–202, 1995.[25] Alexander I. Barvinok. A remark on the rank of positive semidefinite matricessubject to affine constraints. Discrete & Computational Geometry, 25(1):23–31,2001.http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.4627[26] Alexander I. Barvinok. A Course in <strong>Convex</strong>ity. American Mathematical Society,2002.[27] Alexander I. Barvinok. Approximating orthogonal matrices by permutationmatrices. Pure and Applied Mathematics Quarterly, 2:943–961, 2006.[28] Heinz H. Bauschke and Jonathan M. Borwein. On projection algorithms for solvingconvex feasibility problems. SIAM Review, 38(3):367–426, September 1996.[29] Steven R. Bell. The Cauchy Transform, Potential Theory, and Conformal Mapping.CRC Press, 1992.[30] Jean Bellissard and Bruno Iochum. Homogeneous and facially homogeneous self-dualcones. Linear Algebra and its Applications, 19:1–16, 1978.[31] Richard Bellman and Ky Fan. On systems of linear inequalities in Hermitianmatrix variables. In Victor L. Klee, editor, <strong>Convex</strong>ity, volume VII of Proceedings ofSymposia in Pure Mathematics, pages 1–11. American Mathematical Society, 1963.[32] Adi Ben-Israel. Linear equations and inequalities on finite dimensional, real orcomplex, vector spaces: A unified theory. Journal of Mathematical Analysis andApplications, 27:367–389, 1969.[33] Adi Ben-Israel. Motzkin’s transposition theorem, and the related theorems ofFarkas, Gordan and Stiemke. In Michiel Hazewinkel, editor, Encyclopaedia ofMathematics. Springer-Verlag, 2001.http://www.convexoptimization.com/TOOLS/MOTZKIN.pdf[34] Aharon Ben-Tal and Arkadi Nemirovski. Lectures on Modern <strong>Convex</strong> <strong>Optimization</strong>:Analysis, Algorithms, and Engineering Applications. SIAM, 2001.[35] Aharon Ben-Tal and Arkadi Nemirovski. Non-Euclidean restricted memorylevel method for large-scale convex optimization. Mathematical Programming,102(3):407–456, January 2005.http://www2.isye.gatech.edu/~nemirovs/Bundle-Mirror rev fin.pdf[36] John J. Benedetto and Paulo J.S.G. Ferreira editors. Modern Sampling Theory:Mathematics and Applications. Birkhäuser, 2001.

logo

products

Resources

Company

Terms of service
Privacy policy
Cookie policy
Cookie settings
Imprint
Change language
Made with love in Switzerland
© 2024 Yumpu.com all rights reserved

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!