0
$\begingroup$

For a $k-$dimensional optimization variable $b \in \mathbb{R}^k$ say the objective is given as, $$f(b) = \langle b, v \rangle + \langle b , Ab \rangle + \lambda \Vert b \Vert_1$$

for some parameter vector $v \in \mathbb{R}^k$ and $A \in \mathbb{R}^{k \times k}$ and $\lambda >0$.

Can someone let me know what is the ADMM iteration sequence for minimizing $f(b)$?

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.