Convex optimization of graph Laplacian eigenvalues

International Congress of Mathematicians, ICM 2006

Volumn 3, Issue , 2006, Pages 1311-1319

  Boyd, Stephen ^a  

^a Stanford University   (United States)

Author keywords

Convex optimization; Distributed averaging; Effective resistance; Graph theory; Laplacian matrix; Markov chain; Semidefinite programming

Indexed keywords

ALGEBRAIC CONNECTIVITY; DISTRIBUTED AVERAGING; EFFECTIVE RESISTANCES; LAPLACIAN MATRICES; MEAN SQUARE DEVIATION; SEMI-DEFINITE PROGRAMMING; SUFFICIENT OPTIMALITY CONDITIONS; TRANSITION PROBABILITIES;

ALGEBRA; APPROXIMATION THEORY; CONVEX OPTIMIZATION; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; MATRIX ALGEBRA; MIXING; SET THEORY;

MARKOV PROCESSES;

EID: 84878059249     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Bertsekas, D. P., Nonlinear Programming. Second edition, Athena Scientific, Belmont, MA, 1999.
2. Borwein, J., and Lewis, A., Convex Analysis and Nonlinear Optimization, Theory and Examples. CMS Books Math./Ouvrages Math. SMC 3, Springer-Verlag, New York 2000.
3. Boyd, S., Diaconis, P., Parrilo, P., and Xiao, L., Symmetry analysis of reversible Markov chains. Internet Math. 2 (1) (2005), 31-71.
4. Boyd, S., Diaconis, P., Sun, J., and Xiao, L., Fastest mixing Markov chain on a path. Amer. Math. Monthly 113 (1) (2006), 70-74.
5. Boyd, S., Diaconis, P., and Xiao, L., Fastest mixing Markov chain on a graph. SIAM Review 46 (4) (2004), 667-689.
6. Boyd, S., andVandenberghe, L., Convex Optimization. Cambridge University Press, Cambridge 2004.
7. Fiedler, M., Absolute algebraic connectivity of trees. Linear and Multilinear Algebra 26 (1990), 85-106.
8. Ghosh, A., and Boyd, S., Minimizing effective resistance of a graph. SIAM Review, to appear; www.stanford.edu/~boyd/eff-res.
9. Ghosh, A., and Boyd, S., Upper bounds on algebraic connectivity via convex optimization. Linear Algebra Appl., to appear; www.stanford.edu/~boyd/ eigbounds-laplacian.
10. Rockafellar, R. T., Convex Analysis. Princeton University Press, Princeton, NJ, 1970.
11. Sun, J., Boyd, S., Xiao, L., and Diaconis, P., The fastest mixing Markov process on a graph and a connection to amaximum variance unfolding problem. SIAM Review, to appear 2006; www/~boyd/fmmp.
12. Weinberger, K., and Saul, L., Unsupervised learning of image manifolds by semidefinite programming. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR-04), Washington D.C., 2004.
13. Xiao, L., and Boyd, S., Fast linear iterations for distributed averaging. Systems Control Lett. 53 (2004), 65-78.
14. Xiao, L., and Boyd, S., Optimal scaling of a gradient method for distributed resource allocation. J. Optim. Theory Appl. 129 (3) (2006), to appear.
15. Xiao, L., Boyd, S., and Kim, S.-J., Distributed average consensus with least-mean-square deviation. Journal of Parallel and Distributed Computing, summitted May 2005; www/~boyd/lms-consensus.