International Journal of Computer Vision

, Volume 83, Issue 3, pp 294–311

A Predual Proximal Point Algorithm Solving a Non Negative Basis Pursuit Denoising Model


DOI: 10.1007/s11263-009-0227-z

Cite this article as:
Malgouyres, F. & Zeng, T. Int J Comput Vis (2009) 83: 294. doi:10.1007/s11263-009-0227-z


This paper develops an implementation of a Predual Proximal Point Algorithm (PPPA) solving a Non Negative Basis Pursuit Denoising model. The model imposes a constraint on the l2 norm of the residual, instead of penalizing it. The PPPA solves the predual of the problem with a Proximal Point Algorithm (PPA). Moreover, the minimization that needs to be performed at each iteration of PPA is solved with a dual method. We can prove that these dual variables converge to a solution of the initial problem.

Our analysis proves that we turn a constrained non differentiable convex problem into a short sequence of nice concave maximization problems. By nice, we mean that the functions which are maximized are differentiable and their gradient is Lipschitz.

The algorithm is easy to implement, easier to tune and more general than the algorithms found in the literature. In particular, it can be applied to the Basis Pursuit Denoising (BPDN) and the Non Negative Basis Pursuit Denoising (NNBPDN) and it does not make any assumption on the dictionary. We prove its convergence to the set of solutions of the model and provide some convergence rates.

Experiments on image approximation show that the performances of the PPPA are at the current state of the art for the BPDN.


Basis PursuitAlgorithmSparse representationProximal point algorithmell1 minimization

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.LAGA, CNRS UMR 7539Université Paris 13VilletaneuseFrance
  2. 2.Dept. of Mathematics and Institute for Computational MathematicsHong Kong Baptist UniversityKowloon TongHong Kong