The smoothing FR conjugate gradient method for solving a kind of nonsmooth optimization problem with \(l_1\)-norm
type: Item
instance of: scholarly article
title: The smoothing FR conjugate gradient method for solving a kind of nonsmooth optimization problem with \(l_1\)-norm
zbMATH Open document ID: 1427.90293
DOI: 10.1155/2018/5817931
author: Miao Chen
author: Shouqiang Du
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: Summary: We study the method for solving a kind of nonsmooth optimization problems with \(l_1\)-norm, which is widely used in the problem of compressed sensing, image processing, and some related optimization problems with wide application background in engineering technology. Transformated by the absolute value equations, this kind of nonsmooth optimization problem is rewritten as a general unconstrained optimization problem, and the transformed problem is solved by a smoothing FR conjugate gradient method. Finally, the numerical experiments show the effectiveness of the given smoothing FR conjugate gradient method.
Mathematics Subject Classification ID: 90C53
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 7019189
describes a project that uses: SPGL1
describes a project that uses: PDCO
describes a project that uses: TwIST
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2018/5817931
OpenAlex ID: W2785454476
cites work: A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
cites work: Adaptive sparse Volterra system identification with \(\ell _{0}\)-norm penalty
cites work: Atomic Decomposition by Basis Pursuit
cites work: Atomic decomposition by basis pursuit
cites work: From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Probing the Pareto Frontier for Basis Pursuit Solutions
cites work: Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
cites work: Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing
cites work: Q3132645
cites work: A globally and quadratically convergent method for absolute value equations
cites work: Absolute value programming
cites work: A generalized Newton method for absolute value equations
cites work: On nonmonotone Chambolle gradient projection algorithms for total variation image restoration
cites work: Spectral gradient projection method for monotone nonlinear equations with convex constraints
cites work: Function minimization by conjugate gradients
cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
cites work: Global convergence of a modified spectral FR conjugate gradient method
cites work: A class of globally convergent conjugate gradient methods
cites work: Convergence Properties of Nonlinear Conjugate Gradient Methods
cites work: Smoothing methods for nonsmooth, nonconvex minimization
cites work: Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems
cites work: Absolute value equation solution via concave minimization
cites work: Absolute value equations
description: scientific article; zbMATH DE number 7019189