2010/09/30 by Mithun Das Gupta, Sanjeev Kumar, Gupta, Mithun Das +4
Computer Science · Engineering · #Data Structures and Algorithms (cs.DS) #Domain Adaptation and Few-Shot Learning #FOS: Computer and information sciences #Machine Learning and Algorithms #Sparse and Compressive Sensing Techniques #cs.DS
paper · pdf · doi:10.48550/arxiv.1010.0141
arxiv created 2010/09/30 · openalex publication_date 2010/09/30 · arxiv updated 2010/10/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study the L1 minimization problem with additional box constraints. We motivate the problem with two different views of optimality considerations. We look into imposing such constraints in projected gradient techniques and propose a worst case linear time algorithm to perform such projections. We demonstrate the merits and effectiveness of our algorithms on synthetic as well as real experiments.