First-order optimality condition of basis pursuit denoise problem (Q469076): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10483-014-1860-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W125934520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The random minimal spanning tree in high dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stability of the basis pursuit in the presence of noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable signal recovery from incomplete and inaccurate measurements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearized Bregman iterations for compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast linearized Bregman iteration for compressive sensing and sparse denoising / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact matrix completion via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Convex Relaxation: Near-Optimal Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nuclear norm regularization with a low-rank constraint for matrix completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound guaranteeing exact matrix completion via singular value thresholding algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probing the Pareto Frontier for Basis Pursuit Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Singular Value Thresholding Algorithm for Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed point and Bregman iterative methods for matrix rank minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projected Landweber iteration for matrix completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3079892 / rank
 
Normal rank

Latest revision as of 07:10, 9 July 2024

scientific article
Language Label Description Also known as
English
First-order optimality condition of basis pursuit denoise problem
scientific article

    Statements

    First-order optimality condition of basis pursuit denoise problem (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    basis pursuit denoise (BPDN)
    0 references
    fixed point iteration
    0 references
    first-order optimality
    0 references
    matrix completion
    0 references
    0 references
    0 references
    0 references