SECOND-ORDER CONE PROGRAMMING METHODS FOR TOTAL VARIATION-BASED ...

• mémoire

SECOND-ORDER CONE PROGRAMMING METHODS FOR TOTAL VARIATION-BASED IMAGE RESTORATION DONALD GOLDFARB∗ AND WOTAO YIN† February 8, 2005 Abstract. In this paper we present optimization algorithms for image restoration based on the total variation (TV) minimization framework of L. Rudin, S. Osher and E. Fatemi (ROF). Our approach formulates TV minimization as a second-order cone program which is then solved by interior-point algorithms that are efficient both in practice (using nested dissection and domain decomposition) and in theory (i.

• unconstrained minimization problem
• socp
• dual formulation
• order cone program
• interior point methods
• diagonal matrix
• min
• image
• problem