FPC_AS (fixed-point continuation and active set) is a MATLAB solver for the l1-regularized least squares problem: A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation. We propose a fast algorithm for solving the ℓ 1 -regularized minimization problem min x∈ℝ n μ∥x∥ 1 +∥Ax-b∥ 2 2 for recovering sparse solutions to an undetermined system of linear equations Ax=b. The algorithm is divided into two stages that are performed repeatedly. In the first stage a first-order iterative “shrinkage” method yields an estimate of the subset of components of x likely to be nonzero in an optimal solution. Restricting the decision variables x to this subset and fixing their signs at their current values reduces the ℓ 1 -norm ∥x∥ 1 to a linear function of x. The resulting subspace problem, which involves the minimization of a smaller and smooth quadratic function, is solved in the second phase. Our code FPC_AS embeds this basic two-stage algorithm in a continuation (homotopy) approach by assigning a decreasing sequence of values to μ. This code exhibits state-of-the-art performance in terms of both its speed and its ability to recover sparse signals

References in zbMATH (referenced in 60 articles , 1 standard article )

Showing results 1 to 20 of 60.
Sorted by year (citations)

1 2 3 next

  1. Yu, Tengteng; Liu, Xin-Wei; Dai, Yu-Hong; Sun, Jie: Stochastic variance reduced gradient methods using a trust-region-like scheme (2021)
  2. Cheng, Wanyou; Chen, Zixin; Hu, Qingjie: An active set Barzilar-Borwein algorithm for (l_0) regularized optimization (2020)
  3. Mousavi, Ahmad; Rezaee, Mehdi; Ayanzadeh, Ramin: A survey on compressive sensing: classical results and recent advancements (2020)
  4. Shen, Chungen; Xue, Wenjuan; Zhang, Lei-Hong; Wang, Baiyun: An active-set proximal-Newton algorithm for (\ell_1) regularized optimization problems with box constraints (2020)
  5. Wang, Guoqiang; Wei, Xinyuan; Yu, Bo; Xu, Lijun: An efficient proximal block coordinate homotopy method for large-scale sparse least squares problems (2020)
  6. Zhang, Chao; Chen, Xiaojun: A smoothing active set method for linearly constrained non-Lipschitz nonconvex optimization (2020)
  7. Azmi, Behzad; Kunisch, Karl: A hybrid finite-dimensional RHC for stabilization of time-varying parabolic equations (2019)
  8. Becker, Stephen; Fadili, Jalal; Ochs, Peter: On quasi-Newton forward-backward splitting: proximal calculus and convergence (2019)
  9. Cheng, Wanyou; Hu, Qingjie; Li, Donghui: A fast conjugate gradient algorithm with active set prediction for (\ell_1) optimization (2019)
  10. Esmaeili, Hamid; Shabani, Shima; Kimiaei, Morteza: A new generalized shrinkage conjugate gradient method for sparse recovery (2019)
  11. Lin, Meixia; Liu, Yong-Jin; Sun, Defeng; Toh, Kim-Chuan: Efficient sparse semismooth Newton methods for the clustered Lasso problem (2019)
  12. Nutini, Julie; Schmidt, Mark; Hare, Warren: “Active-set complexity” of proximal gradient: how long does it take to find the sparsity pattern? (2019)
  13. Yang, Tianbao; Zhang, Lijun; Jin, Rong; Zhu, Shenghuo; Zhou, Zhi-Hua: A simple homotopy proximal mapping algorithm for compressive sensing (2019)
  14. Zhao, Huan; Gao, Zhenghong; Xu, Fang; Zhang, Yidian; Huang, Jiangtao: An efficient adaptive forward-backward selection method for sparse polynomial chaos expansion (2019)
  15. Cheng, Wanyou; Dai, Yu-Hong: Gradient-based method with active set strategy for (\ell_1) optimization (2018)
  16. Cheng, Wan-You; Li, Dong-Hui: A preconditioned conjugate gradient method with active set strategy for (\ell_1)-regularized least squares (2018)
  17. Huan, Xun; Safta, Cosmin; Sargsyan, Khachik; Vane, Zachary P.; Lacaze, Guilhem; Oefelein, Joseph C.; Najm, Habib N.: Compressive sensing with cross-validation and stop-sampling for sparse polynomial chaos expansions (2018)
  18. Li, Chong-Jun; Zhong, Yi-Jun: A pseudo-heuristic parameter selection rule for (l^1)-regularized minimization problems (2018)
  19. Li, Xudong; Sun, Defeng; Toh, Kim-Chuan: A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems (2018)
  20. Xiao, Xiantao; Li, Yongfeng; Wen, Zaiwen; Zhang, Liwei: A regularized semi-smooth Newton method with projection steps for composite convex programs (2018)

1 2 3 next