An Extension of Averaged-Operator-Based algorithms
An Extension of Averaged-Operator-Based algorithms
Many of the algorithms used to solve minimization problems with sparsity-inducing regularizers are generic in the sense that they do not take into account the sparsity of the solution in any particular way. However, algorithms known as semismooth Newton are able to take advantage of this sparsity to accelerate their …