Nomonotone spectral gradient method for sparse recovery

DOI10.3934/IPI.2015.9.815zbMath1332.90162OpenAlexW2526869101MaRDI QIDQ256063

Wanyou Cheng, Zixin Chen, Dong-hui Li

Publication date: 9 March 2016

Published in: Inverse Problems and Imaging (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/ipi.2015.9.815

zbMATH Keywords

nonsmooth optimizationBarzilai-Borwein method\(\ell_1-\) regularizationiterative shrinkage thresholding algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

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

Uses Software

• PDCO
• FPC_AS

Cites Work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A coordinate gradient descent method for nonsmooth separable minimization
• A method for minimizing the sum of a convex function and a continuously differentiable function
• A minimization method for the sum of a convex function and a continuously differentiable function
• A successive quadratic programming method for a class of constrained nonsmooth optimization problems
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
• Linear convergence of epsilon-subgradient descent methods for a class of convex functions
• Nonmonotone spectral method for large-scale symmetric nonlinear equations
• Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization
• Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
• On the convergence of an active-set method for ℓ₁minimization
• 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
• An EM algorithm for wavelet-based image restoration
• Stable recovery of sparse overcomplete representations in the presence of noise
• Greed is Good: Algorithmic Results for Sparse Approximation
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Two-Point Step Size Gradient Methods
• A generalized proximal point algorithm for certain non-convex minimization problems
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• Sparse Reconstruction by Separable Approximation
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• A Nonmonotone Line Search Technique for Newton’s Method
• Fast Image Recovery Using Variable Splitting and Constrained Optimization
• Local Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
• The cyclic Barzilai-–Borwein method for unconstrained optimization
• Convex Analysis
• Compressed sensing
• Benchmarking optimization software with performance profiles.
• Adaptive greedy approximations

This page was built for publication: Nomonotone spectral gradient method for sparse recovery