A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem

DOI10.1007/s11590-022-01878-6OpenAlexW4226361142MaRDI QIDQ2688917

Nasrin Mirhoseini, Zohre Aminifard, Saman Babaie-Kafaki

Publication date: 6 March 2023

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-022-01878-6

zbMATH Keywords

unconstrained optimizationeigenvalueconjugate gradient methodimage restorationdescent condition

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Related Items (3)

Two diagonal conjugate gradient like methods for unconstrained optimization ⋮ A modified four-term extension of the Dai-Liao conjugate gradient method ⋮ Unnamed Item

Uses Software

• CG_DESCENT
• SCALCG

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems
• Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization
• A modified scaled conjugate gradient method with global convergence for nonconvex functions
• An eigenvalue study on the sufficient descent property of a modified Polak-Ribière-Polyak conjugate gradient method
• New spectral PRP conjugate gradient method for unconstrained optimization
• A new generalized shrinkage conjugate gradient method for sparse recovery
• A descent spectral conjugate gradient method for impulse noise removal
• Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
• Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property
• Acceleration of conjugate gradient algorithms for unconstrained optimization
• New hybrid conjugate gradient and Broyden-Fletcher-Goldfarb-Shanno conjugate gradient methods
• A new hybrid PRPFR conjugate gradient method for solving nonlinear monotone equations and image restoration problems
• 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
• A new accelerated conjugate gradient method for large-scale unconstrained optimization
• A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection
• A class of accelerated conjugate-gradient-like methods based on a modified secant equation
• Global convergence via descent modified three-term conjugate gradient projection algorithm with applications to signal recovery
• Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
• A modified conjugate gradient method for monotone nonlinear equations with convex constraints
• Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization
• 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
• Scaled nonlinear conjugate gradient methods for nonlinear least squares problems
• Three modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property
• A descent extension of the Polak-Ribière-Polyak conjugate gradient method
• 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
• Two Modified Polak–Ribière–Polyak-Type Nonlinear Conjugate Methods with Sufficient Descent Property
• A modified Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Algorithm 851
• Technical Note—A Modified Conjugate Gradient Algorithm
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Restart procedures for the conjugate gradient method
• Convergence Properties of Nonlinear Conjugate Gradient Methods
• Some new three-term Hestenes–Stiefel conjugate gradient methods with affine combination
• Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
• Some descent three-term conjugate gradient methods and their global convergence
• A Two-Term PRP-Based Descent Method
• The conjugate gradient method in extremal problems
• A descent family of Dai–Liao conjugate gradient methods
• New conjugacy conditions and related nonlinear conjugate gradient methods
• Benchmarking optimization software with performance profiles.
• Preconditioned nonlinear conjugate gradient method for micromagnetic energy minimization

This page was built for publication: A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem