v2010.10.26 - Convex Optimization

804 BIBLIOGRAPHYComputing Sciences, Tokyo Institute of Technology, Japan, July 2009.http://math.ewha.ac.kr/~skim/Research/B-457.pdf[225] Yoonsoo Kim and Mehran Mesbahi. On the rank minimization problem. InProceedings of the American Control Conference, volume 3, pages 2015–2020.American Automatic Control Council (AACC), June 2004.[226] Ron Kimmel. Numerical Geometry of Images: Theory, Algorithms, andApplications. Springer-Verlag, 2003.[227] Erwin Kreyszig. Introductory Functional Analysis with Applications. Wiley, 1989.[228] Anthony Kuh, Chaopin Zhu, and Danilo Mandic. Sensor network localization usingleast squares kernel regression. In 10 th International Conference of Knowledge-BasedIntelligent Information and Engineering Systems (KES), volume 4253(III) of LectureNotes in Computer Science, pages 1280–1287, Bournemouth UK, October 2006.Springer-Verlag.http://www.convexoptimization.com/TOOLS/Kuh.pdf[229] Harold W. Kuhn. Nonlinear programming: a historical view. In Richard W. Cottleand Carlton E. Lemke, editors, Nonlinear Programming, pages 1–26. AmericanMathematical Society, 1976.[230] Takahito Kuno, Yasutoshi Yajima, and Hiroshi Konno. An outer approximationmethod for minimizing the product of several convex functions on a convex set.Journal of Global Optimization, 3(3):325–335, September 1993.[231] Amy N. Langville and Carl D. Meyer. Google’s PageRank and Beyond: The Scienceof Search Engine Rankings. Princeton University Press, 2006.[232] Jean B. Lasserre. A new Farkas lemma for positive semidefinite matrices. IEEETransactions on Automatic Control, 40(6):1131–1133, June 1995.[233] Jean B. Lasserre and Eduardo S. Zeron. A Laplace transform algorithm for thevolume of a convex polytope. Journal of the Association for Computing Machinery,48(6):1126–1140, November 2001.http://arxiv.org/abs/math/0106168 (title revision).[234] Monique Laurent. A connection between positive semidefinite and Euclideandistance matrix completion problems. Linear Algebra and its Applications, 273:9–22,1998.[235] Monique Laurent. A tour d’horizon on positive semidefinite and Euclideandistance matrix completion problems. In Panos M. Pardalos and Henry Wolkowicz,editors, Topics in Semidefinite and Interior-Point Methods, pages 51–76. AmericanMathematical Society, 1998.[236] Monique Laurent. Matrix completion problems. In Christodoulos A. Floudas andPanos M. Pardalos, editors, Encyclopedia of Optimization, volume III (Interior-M),pages 221–229. Kluwer, 2001.http://homepages.cwi.nl/~monique/files/opt.ps