v2009.01.01 - Convex Optimization

BIBLIOGRAPHY 735
[191] Mark Kahrs and Karlheinz Brandenburg, editors. Applications of Digital Signal
Processing to Audio and Acoustics. Kluwer Academic Publishers, 1998.
[192] Thomas Kailath. Linear Systems. Prentice-Hall, 1980.
[193] Tosio Kato. Perturbation Theory for Linear Operators.
Springer-Verlag, 1966.
[194] Paul J. Kelly and Norman E. Ladd. Geometry. Scott, Foresman and Company,
1965.
[195] Yoonsoo Kim and Mehran Mesbahi. On the rank minimization problem. In
Proceedings of the American Control Conference, volume 3, pages 2015–2020.
American Automatic Control Council (AACC), June 2004.
[196] Ron Kimmel. Numerical Geometry of Images: Theory, Algorithms, and
Applications. Springer-Verlag, 2003.
[197] Erwin Kreyszig. Introductory Functional Analysis with Applications. Wiley, 1989.
[198] Takahito Kuno, Yasutoshi Yajima, and Hiroshi Konno. An outer approximation
method for minimizing the product of several convex functions on a convex set.
Journal of Global Optimization, 3(3):325–335, September 1993.
[199] Jean B. Lasserre. A new Farkas lemma for positive semidefinite matrices. IEEE
Transactions on Automatic Control, 40(6):1131–1133, June 1995.
[200] Jean B. Lasserre and Eduardo S. Zeron. A Laplace transform algorithm for the
volume of a convex polytope. Journal of the Association for Computing Machinery,
48(6):1126–1140, November 2001.
http://arxiv.org/abs/math/0106168 (title change).
[201] Monique Laurent. A connection between positive semidefinite and Euclidean
distance matrix completion problems. Linear Algebra and its Applications, 273:9–22,
1998.
[202] Monique Laurent. A tour d’horizon on positive semidefinite and Euclidean
distance matrix completion problems. In Panos M. Pardalos and Henry Wolkowicz,
editors, Topics in Semidefinite and Interior-Point Methods, pages 51–76. American
Mathematical Society, 1998.
[203] Monique Laurent. Matrix completion problems. In Christodoulos A. Floudas and
Panos M. Pardalos, editors, Encyclopedia of Optimization, volume III (Interior-M),
pages 221–229. Kluwer, 2001.
http://homepages.cwi.nl/∼monique/files/opt.ps
[204] Monique Laurent and Svatopluk Poljak. On a positive semidefinite relaxation of the
cut polytope. Linear Algebra and its Applications, 223/224:439–461, 1995.
[205] Monique Laurent and Svatopluk Poljak. On the facial structure of the set
of correlation matrices. SIAM Journal on Matrix Analysis and Applications,
17(3):530–547, July 1996.