×

IMRO

swMATH ID: 20465
Software Authors: Karimi, Sahar; Vavasis, Stephen
Description: IMRO: A proximal quasi-Newton method for solving ℓ 1 -regularized least squares problems. We present a proximal quasi-Newton method in which the approximation of the Hessian has the special format of “identity minus rank one” (IMRO) in each iteration. The proposed structure enables us to effectively recover the proximal point. The algorithm is applied to \(ell_1\)-regularized least squares problems arising in many applications including sparse recovery in compressive sensing, machine learning, and statistics. Our numerical experiment suggests that the proposed technique competes favorably with other state-of-the-art solvers for this class of problems. We also provide a complexity analysis for variants of IMRO, showing that it matches known best bounds.
Homepage: https://arxiv.org/abs/1401.4220
Keywords: proximal methods; quasi-Newton methods; sparse recovery; basis pursuit denoising problem; \(ell_1\)-regularized least squares problem; convex optimization; minimization of composite functions
Related Software: NNLS; FPC_AS; TFOCS; TwIST; UNLocBoX; LBFGS-B; UCI-ml; L-BFGS; L1TestPack; Python; MNIST; Saga; SDPNAL+; QUIC; glasso; NewtonLib; SDPT3; iPiano; L-BFGS-B; SGD-QN
Cited in: 11 Documents

Citations by Year