The smoothing FR conjugate gradient method for solving a kind of nonsmooth optimization problem with \(l_1\)-norm
From MaRDI portal
Publication:1721133
DOI10.1155/2018/5817931zbMath1427.90293OpenAlexW2785454476MaRDI QIDQ1721133
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2018/5817931
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)
Related Items
A new smoothing modified three-term conjugate gradient method for \(l_1\)-norm minimization problem, A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization
Uses Software
Cites Work
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing
- A class of globally convergent conjugate gradient methods
- A globally and quadratically convergent method for absolute value equations
- Adaptive sparse Volterra system identification with \(\ell _{0}\)-norm penalty
- Smoothing methods for nonsmooth, nonconvex minimization
- Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems
- Absolute value equations
- Absolute value programming
- Global convergence of a modified spectral FR conjugate gradient method
- On nonmonotone Chambolle gradient projection algorithms for total variation image restoration
- A generalized Newton method for absolute value equations
- Spectral gradient projection method for monotone nonlinear equations with convex constraints
- Absolute value equation solution via concave minimization
- Atomic Decomposition by Basis Pursuit
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Probing the Pareto Frontier for Basis Pursuit Solutions
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Atomic Decomposition by Basis Pursuit
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Function minimization by conjugate gradients
