DocumentCode
3730857
Title
Solving Lasso: Extended ADMM is more efficient than ADMM
Author
Feng Ma; Mingfang Ni; Xiayang Zhang; Zhanke Yu
Author_Institution
College of Communications Engineering, PLA University of Science and Technology, Nanjing, 210007, China
fYear
2015
Firstpage
55
Lastpage
58
Abstract
The least absolute shrinkage and selection operator (Lasso) has become very popular and attractive approach for regularization and variable selection for high-dimensional data in machine learning. In this paper, we present an extended alternating direction method of multipliers (ADMM) for solving the Lasso. The extended ADMM is global convergent, and all the subproblems can easily get the solutions. It can also be implemented in distributed manner, which is beneficial for storage and computation requirement. Numerical experiments demonstrated that the extended ADMM outperforms other popular algorithms.
Keywords
"Acceleration","Convex functions","Benchmark testing","Minimization","Convergence","Algorithm design and analysis","Programmable logic arrays"
Publisher
ieee
Conference_Titel
Chinese Automation Congress (CAC), 2015
Type
conf
DOI
10.1109/CAC.2015.7382469
Filename
7382469
Link To Document