A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems

DOI10.1016/J.CAM.2023.115105zbMath1519.90183MaRDI QIDQ6099495

No author found.

Publication date: 20 June 2023

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

global convergencecomplexity analysissufficient descent conditionnonconvex unconstrained optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (5)

An adaptive conjugate gradient method for impulse noise removal ⋮ An efficient hybrid conjugate gradient method with an adaptive strategy and applications in image restoration problems ⋮ A modified PRP conjugate gradient method for unconstrained optimization and nonlinear equations ⋮ A modified PRP-type derivative-free projection algorithm for constrained nonlinear equations with applications ⋮ A PRP type conjugate gradient method without truncation for nonconvex vector optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems
• Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property
• Spectral gradient method for impulse noise removal
• A spectral PRP conjugate gradient methods for nonconvex optimization problem based on modified line search
• The convergence properties of some new conjugate gradient methods
• Efficient generalized conjugate gradient algorithms. I: Theory
• A descent spectral conjugate gradient method for impulse noise removal
• A note about WYL's conjugate gradient method and its applications
• Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
• An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
• Introductory lectures on convex optimization. A basic course.
• Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
• Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization
• A modified nonlinear Polak-Ribière-Polyak conjugate gradient method with sufficient descent property
• A conjugate gradient algorithm and its applications in image restoration
• A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
• Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization
• A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions
• Cubic regularization of Newton method and its global performance
• A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
• Smoothing strategy along with conjugate gradient algorithm for signal reconstruction
• A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
• Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization
• On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Accelerated Methods for NonConvex Optimization
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A gradient‐type iterative method for impulse noise removal
• Function minimization by conjugate gradients
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization
• New conjugacy conditions and related nonlinear conjugate gradient methods
• Benchmarking optimization software with performance profiles.
• A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression

This page was built for publication: A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems