A new conjugate gradient method for the optimization problem with l₁-norm
From MaRDI portal
(Redirected from Publication:6654110)
A new conjugate gradient method for the optimization problem with \(l 1\)-norm
A new conjugate gradient method for the optimization problem with \(l 1\)-norm
Cites work
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Compressed sensing
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- scientific article; zbMATH DE number 7109378 (Why is no real title available?)
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Non-smooth equations based method for _1-norm problems with applications to compressed sensing
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal reconstruction by conjugate gradient algorithm based on smoothing l₁-norm
- Smoothing methods for nonsmooth, nonconvex minimization
- Smoothing nonlinear conjugate gradient method for image restoration using nonsmooth nonconvex minimization
- Stable signal recovery from incomplete and inaccurate measurements
This page was built for publication: A new conjugate gradient method for the optimization problem with \(l_1\)-norm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6654110)
