Dai-Liao extensions of a descent hybrid nonlinear conjugate gradient method with application in signal processing
From MaRDI portal
Publication:2116059
DOI10.1007/s11075-021-01157-yzbMath1484.65132OpenAlexW3193368045MaRDI QIDQ2116059
Saman Babaie-Kafaki, Zohre Aminifard
Publication date: 16 March 2022
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-021-01157-y
unconstrained optimizationglobal convergenceconjugate gradient methodimage restorationcompressed sensingsufficient descent condition
Numerical optimization and variational techniques (65K10) Methods of quasi-Newton type (90C53) Numerical methods based on nonlinear programming (49M37) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items (9)
A new family of hybrid three-term conjugate gradient methods with applications in image restoration ⋮ A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations ⋮ A family of three-term conjugate gradient projection methods with a restart procedure and their relaxed-inertial extensions for the constrained nonlinear pseudo-monotone equations with applications ⋮ A new sufficiently descent algorithm for pseudomonotone nonlinear operator equations and signal reconstruction ⋮ A new three-term spectral subgradient method for solving absolute value equation ⋮ A family of the modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent and conjugacy conditions ⋮ A descent family of the spectral Hestenes–Stiefel method by considering the quasi-Newton method ⋮ Unnamed Item ⋮ Two modified conjugate gradient methods for unconstrained optimization with applications in image restoration problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints
- Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
- On the sufficient descent condition of the Hager-Zhang conjugate gradient methods
- A new generalized shrinkage conjugate gradient method for sparse recovery
- The convergence properties of some new conjugate gradient methods
- A descent spectral conjugate gradient method for impulse noise removal
- A note about WYL's conjugate gradient method and its applications
- Efficient spectral computation of the stationary states of rotating Bose-Einstein condensates by preconditioned nonlinear conjugate gradient methods
- A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems
- A class of modified FR conjugate gradient method and applications to non-negative matrix factorization
- A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration
- Global convergence via descent modified three-term conjugate gradient projection algorithm with applications to signal recovery
- A modified conjugate gradient method for monotone nonlinear equations with convex constraints
- The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems
- A conjugate gradient algorithm and its applications in image restoration
- A modified spectral conjugate gradient method with global convergence
- An optimal parameter choice for the Dai-Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix
- A hybrid conjugate gradient method with descent property for unconstrained optimization
- A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions
- Scaled conjugate gradient algorithms for unconstrained optimization
- Another hybrid conjugate gradient algorithm for unconstrained optimization
- Optimization theory and methods. Nonlinear programming
- Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A hybridization of the Hestenes–Stiefel and Dai–Yuan conjugate gradient methods based on a least-squares approach
- Algorithm 851
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- An extended Dai-Liao conjugate gradient method with global convergence for nonconvex functions
- A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
- Excessive Gap Technique in Nonsmooth Convex Minimization
- CUTEr and SifDec
- New conjugacy conditions and related nonlinear conjugate gradient methods
- A spectral conjugate gradient method for unconstrained optimization
- Benchmarking optimization software with performance profiles.
- Preconditioned nonlinear conjugate gradient method for micromagnetic energy minimization
This page was built for publication: Dai-Liao extensions of a descent hybrid nonlinear conjugate gradient method with application in signal processing
