Stats, Optimization, & Machine Learning Seminar - Lijun Chen
| Event Description: Lijun Chen, Departments of Computer Science and Telecommunications, University of ÃÛÌÇÖ±²¥ Boulder The Weighted Sum Rate Maximization in MIMO Interference Networks: Minimax Lagrangian Duality and Algorithm

 We take a new approach to the weighted sum-rate maximization in multiple-input multiple-output (MIMO) interference networks, by formulating an equivalent max-min problem. This reformulation has significant implications: the Lagrangian duality of the equivalent max-min problem provides an elegant way to establish the sum-rate duality between an interference network and its reciprocal, and more importantly, suggests a novel iterative minimax algorithm with monotonic convergence for the weighted sum-rate maximization. The design and the convergence proof of the algorithm use only general convex analysis. They apply and extend to other max-min problems with similar structure, and thus provide a general class of algorithms for such optimization problems. Lijun Chen is an Assistant Professor of Computer Science and Telecommunications at the University of ÃÛÌÇÖ±²¥ at Boulder. He received his Ph.D. in Control and Dynamical Systems from the California Institute of Technology in 2007, and was a Research Scientist in Computing + Mathematical Sciences at the same institute before joining the University of ÃÛÌÇÖ±²¥. His current research interests are in complex networked systems, distributed optimization and control, convex relaxation and parsimonious solutions, and game theory and its engineering applications. Seminar meets in DUAN G2B21. |
| Location Information: ÌýÌý() 2000 COLORADO AVÌý Boulder, COÌý |
| Contact Information: Name: Ian Cunningham Phone: 303-492-4668 ·¡³¾²¹¾±±ô:Ìýamassist@colorado.edu |