ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals (Q372857): Difference between revisions

This article develops an algorithm for underdetermined least squares problems with 1-norm constraint on the solution. It relies on a modified Nestorev method that periodically updates the prox-center optimally and renders the proposed method almost always linearly convergent. The method is then applied to find the minimum 1-norm solution to an underdetermined least squares problem when teamed with the Pareto root finder. Numerical tests show that these methods achieve comparable numerical results in comparable time for such a problem in image processing and other areas of application.