In this paper, we propose an interior-point method for large sparse l_1 optimization. After a short introduction, the complete algorithm is introduced and some implementation details are given. We prove that this algorithm is globally convergent under standard mild assumptions. Thus nonconvex problems can be solved successfully. The results of computational experiments given in this paper confirm efficiency and robustness of the proposed method.
Citation
Technical Report No. V942, Institute of Computer Science, AV CR,Prague, November 2005.
Article
View Trust-region interior-point method for large sparse l_1 optimization.