Optimization Online


Computing Estimators of Dantzig Selector type via Column and Constraint Generation

Rahul Mazumder(rahulmaz***at***mit.edu)
Stephen J Wright(swright***at***cs.wisc.edu)
Andrew Zheng(atz***at***mit.edu)

Abstract: We consider a class of linear-programming based estimators in reconstructing a sparse signal from linear measurements. Specific formulations of the reconstruction problem considered here include Dantzig selector, basis pursuit (for the case in which the measurements contain no errors), and the fused Dantzig selector (for the case in which the underlying signal is piecewise constant). In spite of being estimators central to sparse signal processing and machine learning, solving these linear programming problems for large scale instances remains a challenging task, thereby limiting their usage in practice. We show that classic constraint- and column-generation techniques from large scale linear programming, when used in conjunction with a commercial implementation of the simplex method, and initialized with the solution from a closely-related Lasso formulation, yields solutions with high efficiency in many settings.

Keywords: Dantzig selection, simplex method, column and constraint generation

Category 1: Applications -- Science and Engineering (Statistics )

Category 2: Linear, Cone and Semidefinite Programming (Linear Programming )

Citation: Technical report, MIT, August, 2019

Download: [PDF]

Entry Submitted: 08/18/2019
Entry Accepted: 08/18/2019
Entry Last Modified: 08/18/2019

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society