Solving the L1 regularized least square problem via a box-constrained smooth minimization

In this paper, an equivalent smooth minimization for the L1 regularized least square problem is proposed. The proposed problem is a convex box-constrained smooth minimization which allows applying fast optimization methods to find its solution. Further, it is investigated that the property "the dual of dual is primal" holds for the L1 regularized least square problem. A solver for the smooth problem is proposed, and its affinity to the proximal gradient is shown. Finally, the experiments on L1 and total variation regularized problems are performed, and the corresponding results are reported.

[1]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[2]  Thomas S. Huang,et al.  Image Super-Resolution Via Sparse Representation , 2010, IEEE Transactions on Image Processing.

[3]  Yinhe Cao,et al.  Exploiting noise in array CGH data to improve detection of DNA copy number change , 2007, Nucleic acids research.

[4]  Christian A. Rees,et al.  Microarray analysis reveals a major direct role of DNA copy number alteration in the transcriptional program of human breast tumors , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[5]  Xing-Bao Gao,et al.  A novel neural network for nonlinear convex programming , 2004, IEEE Trans. Neural Networks.

[6]  Yong Shi,et al.  Successive Overrelaxation for Laplacian Support Vector Machine , 2015, IEEE Transactions on Neural Networks and Learning Systems.

[7]  Alois Ferscha,et al.  Parallel and Distributed Simulation , 1996, Proceedings of HICSS-29: 29th Hawaii International Conference on System Sciences.

[8]  Katta G. Murty,et al.  Nonlinear Programming Theory and Algorithms , 2007, Technometrics.

[9]  Sitian Qin,et al.  A Two-Layer Recurrent Neural Network for Nonsmooth Convex Optimization Problems , 2015, IEEE Transactions on Neural Networks and Learning Systems.

[10]  Stephen P. Boyd,et al.  Proximal Algorithms , 2013, Found. Trends Optim..

[11]  Mário A. T. Figueiredo,et al.  Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems , 2007, IEEE Journal of Selected Topics in Signal Processing.

[12]  Jun Wang,et al.  A general methodology for designing globally convergent optimization neural networks , 1998, IEEE Trans. Neural Networks.

[13]  Ajay N. Jain,et al.  Genomic and transcriptional aberrations linked to breast cancer pathophysiologies. , 2006, Cancer cell.

[14]  David R. Musicant,et al.  Successive overrelaxation for support vector machines , 1999, IEEE Trans. Neural Networks.

[15]  Qingshan Liu,et al.  A Second-Order Multi-Agent Network for Bound-Constrained Distributed Optimization , 2015, IEEE Transactions on Automatic Control.

[16]  Changshui Zhang,et al.  A Fast Dual Projected Newton Method for l1-Regularized Least Squares , 2011, IJCAI.

[17]  George E. Liu,et al.  A Genome-Wide Analysis of Array-Based Comparative Genomic Hybridization (CGH) Data to Detect Intra-Species Variations and Evolutionary Relationships , 2009, PloS one.

[18]  OrtegaAntonio,et al.  Sparse representation and Bayesian detection of genome copy number alterations from microarray data , 2008 .

[19]  Lei Zhang,et al.  Gabor Feature Based Sparse Representation for Face Recognition with Gabor Occlusion Dictionary , 2010, ECCV.

[20]  Yao-Hua Tan,et al.  Robust group fused lasso for multisample copy number variation detection under uncertainty. , 2016, IET systems biology.

[21]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[22]  J. Lupski.  Structural variation in the human genome. , 2007, The New England journal of medicine.

[23]  Haesun Park,et al.  Fast Active-set-type Algorithms for L1-regularized Linear Regression , 2010, AISTATS.

[24]  Fang-Xiang Wu,et al.  Sparse Representation for Classification of Tumors Using Gene Expression Data , 2009, Journal of biomedicine & biotechnology.

[25]  Jun Wang,et al.  A recurrent neural network with exponential convergence for solving convex quadratic program and related linear piecewise equations , 2004, Neural Networks.

[26]  Allen Y. Yang,et al.  Feature Selection in Face Recognition: A Sparse Representation Perspective , 2007 .

[27]  Sohrab Effati,et al.  An Efficient Neural Network Model for Solving the Absolute Value Equations , 2018, IEEE Transactions on Circuits and Systems II: Express Briefs.

[28]  Guillermo Sapiro,et al.  Sparse Representation for Computer Vision and Pattern Recognition , 2010, Proceedings of the IEEE.

[29]  Jun Wang.  Analysis and design of a recurrent neural network for linear programming , 1993 .

[30]  Kenny Q. Ye,et al.  Removing System Noise from Comparative Genomic Hybridization Data by Self-Self Analysis , 2011, 1105.0900.

[31]  Majid Mohammadi,et al.  A robust Correntropy-based method for analyzing multisample aCGH data. , 2015, Genomics.

[32]  Michael Elad,et al.  Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries , 2006, IEEE Transactions on Image Processing.

[33]  Jiming Liu,et al.  Piecewise-constant and low-rank approximation for identification of recurrent copy number variations , 2014, Bioinform..

[34]  Jean-Philippe Vert,et al.  The group fused Lasso for multiple change-point detection , 2011, 1106.4199.

[35]  Hongyu Zhao,et al.  Multisample aCGH Data Analysis via Total Variation and Spectral Regularization , 2013, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[36]  Allen Y. Yang,et al.  Robust Face Recognition via Sparse Representation , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[37]  Jean-Jacques Fuchs,et al.  On sparse representations in arbitrary redundant bases , 2004, IEEE Transactions on Information Theory.

[38]  Antonio Ortega,et al.  Sparse representation and Bayesian detection of genome copy number alterations from microarray data , 2008, Bioinform..

[39]  D. Pinkel,et al.  Array comparative genomic hybridization and its applications in cancer , 2005, Nature Genetics.

[40]  Zaïd Harchaoui,et al.  Catching Change-points with Lasso , 2007, NIPS.

[41]  Xuyang Lou,et al.  A novel neural network for solving convex quadratic programming problems subject to equality and inequality constraints , 2016, Neurocomputing.