A modified Dai-Liao conjugate gradient method with a new parameter for solving image restoration problems
From MaRDI portal
Publication:2004127
Recommendations
- A modified Dai-Liao conjugate gradient method for solving unconstrained optimization and image restoration problems
- A modified HS-DY-type method with nonmonotone line search for image restoration and unconstrained optimization problems
- A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem
- A new conjugate gradient method based on a modified secant condition with its applications in image processing
- scientific article; zbMATH DE number 7267270
Cites work
- scientific article; zbMATH DE number 6173889 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A class of adaptive dai-liao conjugate gradient methods based on the scaled memoryless BFGS update
- A class of parameter estimation methods for nonlinear Muskingum model using hybrid invasive weed optimization algorithm
- A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems
- A new efficient conjugate gradient method for unconstrained optimization
- A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
- A spectral conjugate gradient method for unconstrained optimization
- 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
- An optimal parameter for Dai-Liao family of conjugate gradient methods
- Benchmarking optimization software with performance profiles.
- Convergence Properties of Algorithms for Nonlinear Optimization
- Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
- Function minimization by conjugate gradients
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- New properties of a nonlinear conjugate gradient method
- New quasi-Newton methods for unconstrained optimization problems
- On the sufficient descent condition of the Hager-Zhang conjugate gradient methods
- Rate of Convergence of Several Conjugate Gradient Algorithms
- The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems
- 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
- The superlinear convergence of a modified BFGS-type method for unconstrained optimization
Cited in
(6)- Modified three-term Liu-Storey conjugate gradient method for solving unconstrained optimization problems and image restoration problems
- A modified Dai-Liao conjugate gradient method for solving unconstrained optimization and image restoration problems
- A new conjugate gradient method based on a modified secant condition with its applications in image processing
- A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem
- Improving the Dai-Liao parameter choices using a fixed point equation
- An accelerated conjugate gradient method with adaptive two-parameter with applications in image restoration
This page was built for publication: A modified Dai-Liao conjugate gradient method with a new parameter for solving image restoration problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2004127)
