The modified accelerated Bregman method for regularized basis pursuit problem

DOI10.1186/1029-242X-2014-130zbMath1375.46058WikidataQ59323906 ScholiaQ59323906MaRDI QIDQ2405606

Yi-Fen Ke, Ya-Jun Xie, Chang-Feng Ma

Publication date: 26 September 2017

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

zbMATH Keywords

convergence ratecompressed sensinglinear constraintBregman methodmodified accelerated method

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)

Related Items

The relaxed gradient based iterative algorithm for solving matrix equations \(A_iXB_i=F_i\), The scaling conjugate gradient iterative method for two types of linear matrix equations, The matrix iterative methods for solving a class of generalized coupled Sylvester-conjugate linear matrix equations

Uses Software

• L-BFGS
• SPGL1
• RASL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization
• On the limited memory BFGS method for large scale optimization
• Fast linearized Bregman iteration for compressive sensing and sparse denoising
• The geometry of graphs and some of its algorithmic applications
• Accelerated linearized Bregman method
• Exact matrix completion via convex optimization
• Analysis and Generalizations of the Linearized Bregman Method
• Linearized Bregman iterations for compressed sensing
• A Singular Value Thresholding Algorithm for Matrix Completion
• The Split Bregman Method for L1-Regularized Problems
• Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
• Exact Regularization of Convex Programs
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Decoding by Linear Programming
• Probing the Pareto Frontier for Basis Pursuit Solutions
• Two-Point Step Size Gradient Methods
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
• Stable signal recovery from incomplete and inaccurate measurements
• An Iterative Regularization Method for Total Variation-Based Image Restoration
• Compressed sensing