Efficient Schemes for Total Variation Minimization Under Constraints in Image Processing

New fast algorithms to minimize total variation and more generally $l^1$-norms under a general convex constraint and a recent advance in convex optimization proposed by Yurii Nesterov are presented.