论文部分内容阅读
In this paper, we present m-time secant-like multi-projection algorithm for sparse unconstrained minimization problem. We prove this method are all q-superlinearly convergent to the solution about m≥ l. At last, we discuss from some numerical results, how