Modified three-term Liu-Storey conjugate gradient method for solving unconstrained optimization problems and image restoration problems
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Methods of reduced gradient type (90C52) Methods of quasi-Newton type (90C53) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Summary: A new three-term conjugate gradient method is proposed in this article. The new method was able to solve unconstrained optimization problems, image restoration problems, and compressed sensing problems. The method is the convex combination of the steepest descent method and the classical LS method. Without any linear search, the new method has sufficient descent property and trust region property. Unlike previous methods, the information for the function \(f\left( x\right)\) is assigned to \(d_k\). Next, we make some reasonable assumptions and establish the global convergence of this method under the condition of using the modified Armijo line search. The results of subsequent numerical experiments prove that the new algorithm is more competitive than other algorithms and has a good application prospect.
- A modified Dai-Liao conjugate gradient method for solving unconstrained optimization and image restoration problems
- A class of new three-term descent conjugate gradient algorithms for large-scale unconstrained optimization and applications to image restoration problems
- A modified Liu-Storey-conjugate descent hybrid projection method for convex constrained nonlinear equations and image restoration
- Two modified conjugate gradient methods for unconstrained optimization with applications in image restoration problems
- A new family of hybrid three-term conjugate gradient methods with applications in image restoration
- A three-term conjugate gradient algorithm with restart procedure to solve image restoration problems
- A modified Dai-Liao conjugate gradient method with a new parameter for solving image restoration problems
- A class of spectral three-term descent Hestenes-Stiefel conjugate gradient algorithms for large-scale unconstrained optimization and image restoration problems
- A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations
- Some modified Hestenes-Stiefel conjugate gradient algorithms with application in image restoration
- A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems
- 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 Modified PRP Conjugate Gradient Algorithm with Trust Region for Optimization Problems
- A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A PRP-based residual method for large-scale monotone nonlinear equations
- A short note on the global convergence of the unmodified PRP method
- An unconstrained optimization test functions collection
- Benchmarking optimization software with performance profiles.
- Convergence analysis of a modified BFGS method on convex minimizations
- Efficient generalized conjugate gradient algorithms. I: Theory
- Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
- Function minimization by conjugate gradients
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Global convergence of a modified Hestenes-Stiefel nonlinear conjugate gradient method with Armijo line search
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- Global convergence of the DY conjugate gradient method with Armijo line search for unconstrained optimization problems
- Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- 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?)
- Methods of conjugate gradients for solving linear systems
- New properties of a nonlinear conjugate gradient method
- On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
- Some sufficient descent conjugate gradient methods and their global convergence
- The conjugate gradient method in extremal problems
- The convergence properties of some new conjugate gradient methods
- The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
- The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems
- A descent conjugate gradient algorithm for optimization problems and its applications in image restoration and compression sensing
- Two modified conjugate gradient methods for unconstrained optimization with applications in image restoration problems
- A modified Dai-Liao conjugate gradient method for solving unconstrained optimization and image restoration problems
- A new family of hybrid three-term conjugate gradient methods with applications in image restoration
- A new conjugate gradient method based on a modified secant condition with its applications in image processing
- A derivative-free three-term Hestenes–Stiefel type method for constrained nonlinear equations and image restoration
- A modified HS-DY-type method with nonmonotone line search for image restoration and unconstrained optimization problems
- scientific article; zbMATH DE number 7680757 (Why is no real title available?)
- A three-term conjugate gradient algorithm with restart procedure to solve image restoration problems
- A convex combination between two different search directions of conjugate gradient method and application in image restoration
- Global convergence of three-term conjugate gradient methods on general functions under a new inexact line search strategy
- New conjugate gradient image processing methods
This page was built for publication: Modified three-term Liu-Storey conjugate gradient method for solving unconstrained optimization problems and image restoration problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2209686)
