A new smoothing modified three-term conjugate gradient method for l₁-norm minimization problem
From MaRDI portal
Publication:824554
global convergencenonsmooth optimization problemsmoothing modified three-term conjugate gradient method
Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Recommendations
- The smoothing FR conjugate gradient method for solving a kind of nonsmooth optimization problem with \(l_1\)-norm
- Signal reconstruction by conjugate gradient algorithm based on smoothing \(l_1\)-norm
- Modified three-term conjugate gradient method and its applications
- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
- A three-term conjugate gradient algorithm for large-scale nonsmooth minimizations
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A generalized Newton method for absolute value equations
- A globally and quadratically convergent method for absolute value equations
- A new modified three-term conjugate gradient method with sufficient descent property and its global convergence
- A relaxed extragradient-like method for a class of constrained optimization problem
- Absolute value equation solution via concave minimization
- Absolute value programming
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Fast linearized Bregman iteration for compressive sensing and sparse denoising
- Finite convergence of a projected proximal point algorithm for the generalized variational inequalities
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Function minimization by conjugate gradients
- Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems
- Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing
- On best proximity point theorems without ordering
- On nonmonotone Chambolle gradient projection algorithms for total variation image restoration
- On the global convergence of the Hager-Zhang conjugate gradient method with Armijo line search
- Smoothing methods for nonsmooth, nonconvex minimization
- Spectral gradient projection method for monotone nonlinear equations with convex constraints
- The smoothing FR conjugate gradient method for solving a kind of nonsmooth optimization problem with \(l_1\)-norm
- The smoothing gradient method for a kind of special optimization problem
- Three modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property
Cited in
(4)- A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization
- Signal reconstruction by conjugate gradient algorithm based on smoothing \(l_1\)-norm
- Modified three-term conjugate gradient method and its applications
- The smoothing FR conjugate gradient method for solving a kind of nonsmooth optimization problem with \(l_1\)-norm
This page was built for publication: A new smoothing modified three-term conjugate gradient method for \(l_1\)-norm minimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q824554)
