|
|||||||
|
|
|
|
|
|
|
||
| Report ID: | 07-09-21322-37 |
| Initial Submission Date: | 2007-09-02 |
| Title: | Convergence of the Min-Sum Algorithm for Convex Optimization |
| Summary: | We establish that the min-sum message-passing algorithm and its asynchronous variants converge for a large class of unconstrained convex optimization problems. |
| Authors: | Moallemi, Ciamac; Van Roy, Benjamin |
| Contact email: | ciamac@stanford.edu |
| Number of views : 682 Number of downloads : 234 |
| Version | Date | Accessible? | Download |
| 1 | 2007-09-02 | y | download |