CS 8292: Advanced Topics in Convex Optimization and its Applications

 

1. A 69-character Matlab LP Solver by Zhonghao Zhang

Project Slide

Project Code:

for i=1:50,X=diag(x);F=X*null(A*X);d=F*F'*c;x=x-d/max(X\abs(d))/2;end

Project Reference:

http://www.stanford.edu/~jacobm/lp75.html

 

2. QP-based Relaxation for Max-Cut Problem by Yayu Gao

Project Slide

 

3. Branch and Bound Method for Sparse Signal Reconstruction by Ruitao Xie

Project Slide

Project Reference:

http://www.stanford.edu/class/ee364b/lectures/bb_slides.pdf

 

4. Branch and Bound Algorithm and its Application in Compressed Sensing by Ruofei Chen

Project Slide

Project Reference:

http://www.stanford.edu/class/ee364b/lectures/bb_slides.pdf

 

5. Branch and Bound in Large Scale Web Video Summarization by Song Tan

Project Slide

 

6. Optimization for Two-way Relay Channel with Analogue Network Coding by Jianwen Zhang

Project Slide

 

7. Multiuser OFDM with Adaptive Subcarrier, Bit and Power Allocation by Junyuan Wang

Project Slide

 

8. Max Cut Exact Method SDP Based Branch and Bound by Yik Juen Cheung

Project Slide

 

9. Approximate Optimal Solution of Power Allocation on Multiuser MIMO System by Zhiyang Liu

Project Slide

 

10. Iterative Waterfilling for MIMO MAC by Junjie Ma

Project Slide

vBulletin analytics