Timeline for Solving Convex Optimization Problem Used for High Quality Denoising
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 27, 2013 at 17:16 | vote | accept | John Robertson | ||
| Feb 3, 2013 at 0:04 | comment | added | Deniz | thang, as I mentioned before, I am not an expert on this domain. You can see the paper of Chambolle and see that how primal-dual methods can be used to solve the problems like $\ell_1$ or TV regularization. | |
| Feb 2, 2013 at 1:12 | comment | added | thang | I thought primal dual is combinatorial optimization? How can you transform this problem generically (for a generic $f$) into that framework? | |
| Oct 5, 2012 at 13:41 | comment | added | Deniz | Mohammad, I did not implement any primal-dual algorithm for inverse problems. However, you can see an example from the link I mentioned in the answer: the paper of Chambolle. From this paper, you can see what a primal-dual algorithm means precisely. These methods provide just another (and fastly convergent) solution to inverse problems. | |
| Oct 4, 2012 at 17:28 | comment | added | Spacey | What does 'primal-dual' refer to exactly? | |
| Oct 2, 2012 at 20:04 | history | edited | Deniz | CC BY-SA 3.0 |
added 372 characters in body
|
| Sep 27, 2012 at 19:46 | history | answered | Deniz | CC BY-SA 3.0 |