A fast conjugate gradient algorithm with active set prediction for ℓ1 optimization

DOI10.1080/10556788.2018.1496433OpenAlexW2890208180MaRDI QIDQ5238070

Qing-Jie Hu, Wanyou Cheng, Dong-hui Li

Publication date: 28 October 2019

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2018.1496433

zbMATH Keywords

conjugate gradientactive setsparse optimization

Mathematics Subject Classification ID

Numerical analysis (65-XX) Calculus of variations and optimal control; optimization (49-XX) Operations research, mathematical programming (90-XX)

Related Items

Sparse solutions to an underdetermined system of linear equations via penalized Huber loss

Uses Software

• FPC_AS
• IMRO
• TwIST

Cites Work

• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
• A new Kohn-Vogelius type formulation for inverse source problems
• A family of second-order methods for convex \(\ell _1\)-regularized optimization
• A coordinate gradient descent method for nonsmooth separable minimization
• A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
• Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
• Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems
• A Fast Active Set Block Coordinate Descent Algorithm for $\ell_1$-Regularized Least Squares
• A second-order method for convex₁-regularized optimization with active-set prediction
• On the convergence of an active-set method for ℓ₁minimization
• Activity Identification and Local Linear Convergence of Forward--Backward-type Methods
• A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
• A First-Order Smoothed Penalty Method for Compressed Sensing
• Gradient-Based Methods for Sparse Recovery
• Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• A Preconditioner for A Primal-Dual Newton Conjugate Gradient Method for Compressed Sensing Problems
• An EM algorithm for wavelet-based image restoration
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Sparse Reconstruction by Separable Approximation
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
• A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions
• Fast Image Recovery Using Variable Splitting and Constrained Optimization
• Local Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs
• A Two-Term PRP-Based Descent Method
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
• IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems
• Compressed sensing
• Benchmarking optimization software with performance profiles.