First-order optimality condition of basis pursuit denoise problem
From MaRDI portal
Publication:469076
DOI10.1007/s10483-014-1860-9zbMath1298.49039OpenAlexW125934520MaRDI QIDQ469076
Shi Shu, Wei Zhu, Li-Zhi Cheng
Publication date: 10 November 2014
Published in: Applied Mathematics and Mechanics. (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10483-014-1860-9
Semidefinite programming (90C22) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Optimality conditions for minimax problems (49K35)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Fixed point and Bregman iterative methods for matrix rank minimization
- A lower bound guaranteeing exact matrix completion via singular value thresholding algorithm
- The random minimal spanning tree in high dimensions
- Projected Landweber iteration for matrix completion
- Fast linearized Bregman iteration for compressive sensing and sparse denoising
- On the stability of the basis pursuit in the presence of noise
- Exact matrix completion via convex optimization
- Linearized Bregman iterations for compressed sensing
- A Singular Value Thresholding Algorithm for Matrix Completion
- Nuclear norm regularization with a low-rank constraint for matrix completion
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Atomic Decomposition by Basis Pursuit
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
This page was built for publication: First-order optimality condition of basis pursuit denoise problem
