New nonsmooth equations-based algorithms for \(\ell_1\)-norm minimization and applications (Q1952757): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Extensions of compressed sensing / 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: For most large underdetermined systems of linear equations the minimal 𝓁<sub>1</sub>‐norm solution is also the sparsest solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / 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: A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Point Step Size Gradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Reconstruction by Separable Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral gradient projection method for solving nonlinear monotone equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of derivative-free methods for large-scale nonlinear monotone equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252831 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent BFGS method for nonlinear monotone equations without any merit functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and nonsmooth analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonsmooth version of Newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of error bounds for P-matrix linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified BFGS method and its global convergence in nonconvex minimization / rank
 
Normal rank

Latest revision as of 11:18, 6 July 2024

scientific article
Language Label Description Also known as
English
New nonsmooth equations-based algorithms for \(\ell_1\)-norm minimization and applications
scientific article

    Statements

    New nonsmooth equations-based algorithms for \(\ell_1\)-norm minimization and applications (English)
    0 references
    0 references
    3 June 2013
    0 references
    Summary: Recently, \textit{Y. Xiao} et al. [Nonlinear Anal., Theory Methods Appl., Ser. A, Theory Methods 74, No. 11, 3570--3577 (2011; Zbl 1217.65069)] proposed a nonsmooth equations-based method to solve the \(\ell_1\)-norm minimization problem. The advantage of this method is its simplicity and lower storage. In this paper, based on new nonsmooth equations reformulation, we investigate new nonsmooth equations-based algorithms for solving \(\ell_1\)-norm minimization problems. Under mild conditions, we show that the proposed algorithms are globally convergent. The preliminary numerical results demonstrate the effectiveness of the proposed algorithms.
    0 references
    convex optimization
    0 references
    \(\ell_1\)-norm minimization problem
    0 references
    nonsmooth equations
    0 references
    algorithm
    0 references
    numerical results
    0 references
    0 references
    0 references

    Identifiers