In the previous chapter, we introduce the gradient descent and accelerated gradient algorithm to solve the unconstrained optimization. We show the convergence rates of these two algorithms when the objective function is smooth. However, in Lasso \(\min _{\beta } \frac {1}{2}\|Y - \mathbb {X}\beta \|_2^2 + \lambda \|\beta \|_1\) , the \(\ell _1\) -norm penalty term is not smooth.

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

Proximal Gradient Descent

  • Junwei Lu

摘要

In the previous chapter, we introduce the gradient descent and accelerated gradient algorithm to solve the unconstrained optimization. We show the convergence rates of these two algorithms when the objective function is smooth. However, in Lasso \(\min _{\beta } \frac {1}{2}\|Y - \mathbb {X}\beta \|_2^2 + \lambda \|\beta \|_1\) , the \(\ell _1\) -norm penalty term is not smooth.