Constructing new weighted l1-algorithms for the sparsest points of polyhedral sets

Yun Bin Zhao, Zhi Quan Luo

Research output: Contribution to journalArticlepeer-review

12 Scopus citations


The l0-minimization problem that seeks the sparsest point of a polyhedral set is a long-standing, challenging problem in the fields of signal and image processing, numerical linear algebra, and mathematical optimization. The weighted l1-method is one of the most plausible methods for solving this problem. In this paper we develop a new weighted l1-method through the strict complementarity theory of linear programs. More specifically, we show that locating the sparsest point of a polyhedral set can be achieved by seeking the densest possible slack variable of the dual problem of weighted l1-minimization. As a result, l0-minimization can be transformed, in theory, to l0-maximization in dual space through some weight. This theoretical result provides a basis and an incentive to develop a new weighted l1-algorithm, which is remarkably distinct from existing sparsity-seeking methods. The weight used in our algorithm is computed via a certain convex optimization instead of being determined locally at an iterate. The guaranteed performance of this algorithm is shown under some conditions, and the numerical performance of the algorithm has been demonstrated by empirical simulations.

Original languageEnglish (US)
Pages (from-to)57-76
Number of pages20
JournalMathematics of Operations Research
Issue number1
StatePublished - Feb 2017

Bibliographical note

Publisher Copyright:
© 2016 INFORMS.


  • Bilevel programming
  • Convex optimization
  • Duality theory
  • Polyhedral set
  • Sparsest point
  • Sparsity recovery
  • Strict complementarity
  • Weighted l1-algorithm


Dive into the research topics of 'Constructing new weighted l1-algorithms for the sparsest points of polyhedral sets'. Together they form a unique fingerprint.

Cite this