Continuous Iteratively Reweighted Least Squares Algorithm for Solving Linear Models by Convex Relaxation

摘要

In this paper, we present continuous iteratively reweighted least squares algorithm (CIRLS) for solving the linear models problem by convex relaxation, and prove the convergence of this algorithm. Under some conditions, we give an error bound for the algorithm. In addition, the numerical result shows the efficiency of the algorithm.