Loading...
Please wait, while we are loading the content...
Similar Documents
Stat 375 Project Proposal: Convex relaxations and belief propagation equivalence in combinatorial optimization problems (2011)
| Content Provider | CiteSeerX |
|---|---|
| Author | Kraning, Matt |
| Abstract | For my project I will investigate the equivalence between convex programming relaxations and message passing algorithms on hard, combinatorial optimization problems. It has been shown that when the LP relaxations of such problems as weighted b-matchings [1], max weight matchings [2], and max-weight independent set [3] [4] are tight, then the max-product |
| File Format | |
| Publisher Date | 2011-01-01 |
| Access Restriction | Open |
| Subject Keyword | Belief Propagation Equivalence Project Proposal Convex Relaxation Weighted B-matchings Lp Relaxation Combinatorial Optimization Problem |
| Content Type | Text |