Abstract Regularization of certain linear discrete ill-posed problems, as well regression can be formulated large-scale, possibly nonconvex, minimization whose objective function is the sum p th power ℓ -norm a fidelity term and q regularization term, with 0 < , ≤ 2. We describe new restarted iterative solution methods that require less computer storage execution time than described by Huang...