A class of line search-type methods for nonsmooth convex regularized minimization
From MaRDI portal
Publication:2098339
Recommendations
- A spectral-type conjugate gradient method for nonsmooth convex minimization
- scientific article; zbMATH DE number 7404502
- Nomonotone spectral gradient method for sparse recovery
- Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing
- Conjugate gradient type methods for the nondifferentiable convex minimization
Cites work
- A derivative-free conjugate residual method using secant condition for general large-scale nonlinear equations
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A globally convergent version of the Polak-Ribière conjugate gradient method
- A hybrid MBFGS and CBFGS method for nonconvex minimization with a global complexity bound
- A modified BFGS type quasi-Newton method with line search for symmetric nonlinear equations problems
- A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions
- A modified Perry's conjugate gradient method-based derivative-free method for solving large-scale nonlinear monotone equations
- A Nonmonotone Line Search Technique for Newton’s Method
- A short note on the global convergence of the unmodified PRP method
- A three-term conjugate gradient algorithm for large-scale unconstrained optimization problems
- A three-term derivative-free projection method for nonlinear monotone system of equations
- A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
- Compressed sensing
- Convergence properties of an iterative method for solving symmetric non-linear equations
- CUTE
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing
- Norm descent conjugate gradient methods for solving symmetric nonlinear equations
- On the Barzilai and Borwein choice of steplength for the gradient method
- On the convergence properties of the unmodified PRP method with a non-descent line search
- On the Q-linear convergence rate of a class of methods for monotone nonlinear equations
- Smoothing nonlinear conjugate gradient method for image restoration using nonsmooth nonconvex minimization
- Some three-term conjugate gradient methods with the inexact line search condition
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The conjugate gradient method in extremal problems
- The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
- Two-Point Step Size Gradient Methods
Cited in
(4)- Line search termination criteria for collinear scaling algorithms for minimizing a class of convex functions
- On convergence and complexity analysis of an accelerated forward-backward algorithm with linesearch technique for convex minimization problems and applications to data prediction and classification
- A nonmonotone line search method for noisy minimization
- Fast _1-regularized EEG source localization using variable projection
This page was built for publication: A class of line search-type methods for nonsmooth convex regularized minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2098339)
