v2009.01.01 - Convex Optimization

728 BIBLIOGRAPHY
[91] Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz
Taslakian, Godfried T. Toussaint, Terry Winograd, and David R. Wood. The
distance geometry of music, 2007.
http://arxiv.org/abs/0705.4085
[92] Frank Deutsch. Best Approximation in Inner Product Spaces. Springer-Verlag, 2001.
[93] Frank Deutsch and Hein Hundal. The rate of convergence of Dykstra’s cyclic
projections algorithm: The polyhedral case. Numerical Functional Analysis and
Optimization, 15:537–565, 1994.
[94] Frank Deutsch and Peter H. Maserick. Applications of the Hahn-Banach theorem
in approximation theory. SIAM Review, 9(3):516–530, July 1967.
[95] Frank Deutsch, John H. McCabe, and George M. Phillips. Some algorithms for
computing best approximations from convex cones. SIAM Journal on Numerical
Analysis, 12(3):390–403, June 1975.
[96] Michel Marie Deza and Monique Laurent. Geometry of Cuts and Metrics.
Springer-Verlag, 1997.
[97] Carolyn Pillers Dobler. A matrix approach to finding a set of generators and finding
the polar (dual) of a class of polyhedral cones. SIAM Journal on Matrix Analysis
and Applications, 15(3):796–803, July 1994. Erratum: p.189 herein.
[98] Elizabeth D. Dolan, Robert Fourer, Jorge J. Moré, and Todd S. Munson.
Optimization on the NEOS server. SIAM News, 35(6):4,8,9, August 2002.
[99] Bruce Randall Donald. 3-D structure in chemistry and molecular biology, 1998.
http://www.cs.duke.edu/brd/Teaching/Previous/Bio
[100] David L. Donoho. Compressed sensing. IEEE Transactions on Information Theory,
52(4):1289–1306, April 2006.
www-stat.stanford.edu/∼donoho/Reports/2004/CompressedSensing091604.pdf
[101] David L. Donoho, Michael Elad, and Vladimir Temlyakov. Stable recovery of
sparse overcomplete representations in the presence of noise. IEEE Transactions
on Information Theory, 52(1):6–18, January 2006.
www-stat.stanford.edu/∼donoho/Reports/2004/StableSparse-Donoho-etal.pdf
[102] David L. Donoho and Philip B. Stark. Uncertainty principles and signal recovery.
SIAM Journal on Applied Mathematics, 49(3):906–931, June 1989.
[103] David L. Donoho and Jared Tanner. Thresholds for the recovery of sparse solutions
via l1 minimization. In Proceedings of the 40th Annual Conference on Information
Sciences and Systems, pages 202–206. IEEE, March 2006.
[104] Miguel Nuno Ferreira Fialho dos Anjos. New Convex Relaxations for the Maximum
Cut and VLSI Layout Problems. PhD thesis, University of Waterloo, Ontario
Canada, Department of Combinatorics and Optimization, 2001.
cheetah.vlsi.uwaterloo.ca/∼anjos/MFAnjosPhDThesis.pdf