<p>In this paper, an improved alternating direction method of multipliers (ADMM) algorithm is proposed and applied to solve the Lasso (Least Absolute Shrinkage and Selection Operator) problem. The Lagrange multiplier is enhanced by means of the Nesterov accelerated gradient method, and hence the dual problem can approach the optimal value quickly. Compared with the traditional ADMM algorithm, the proposed algorithm has faster convergence rates. Finally, the simulation example verifies the efficiency of the proposed algorithm.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Enhanced ADMM for solving the Lasso problem: integrating the Nesterov accelerated gradient method

  • Shengke Yang,
  • Jing Chen,
  • Yawen Mao,
  • Yang Yi

摘要

In this paper, an improved alternating direction method of multipliers (ADMM) algorithm is proposed and applied to solve the Lasso (Least Absolute Shrinkage and Selection Operator) problem. The Lagrange multiplier is enhanced by means of the Nesterov accelerated gradient method, and hence the dual problem can approach the optimal value quickly. Compared with the traditional ADMM algorithm, the proposed algorithm has faster convergence rates. Finally, the simulation example verifies the efficiency of the proposed algorithm.