A new smoothing modified three-term conjugate gradient method for \(l_1\)-norm minimization problem
DOI10.1186/s13660-018-1696-9zbMath1497.65100OpenAlexW2806166494WikidataQ55177807 ScholiaQ55177807MaRDI QIDQ824554
Publication date: 15 December 2021
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-018-1696-9
global convergencenonsmooth optimization problemsmoothing modified three-term conjugate gradient method
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Methods of quasi-Newton type (90C53) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Finite convergence of a projected proximal point algorithm for the generalized variational inequalities
- Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing
- A globally and quadratically convergent method for absolute value equations
- Smoothing methods for nonsmooth, nonconvex minimization
- Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems
- Absolute value programming
- Fast linearized Bregman iteration for compressive sensing and sparse denoising
- On nonmonotone Chambolle gradient projection algorithms for total variation image restoration
- A generalized Newton method for absolute value equations
- The smoothing FR conjugate gradient method for solving a kind of nonsmooth optimization problem with \(l_1\)-norm
- On best proximity point theorems without ordering
- Spectral gradient projection method for monotone nonlinear equations with convex constraints
- Three modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property
- A new modified three-term conjugate gradient method with sufficient descent property and its global convergence
- Absolute value equation solution via concave minimization
- A relaxed extragradient-like method for a class of constrained optimization problem
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Function minimization by conjugate gradients
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
This page was built for publication: A new smoothing modified three-term conjugate gradient method for \(l_1\)-norm minimization problem
