Two families of hybrid conjugate gradient methods with restart procedures and their applications
From MaRDI portal
Publication:6078424
DOI10.1080/10556788.2023.2189718zbMath1523.90308OpenAlexW4361234123MaRDI QIDQ6078424
Xian-Zhen Jiang, Xiaodi Wu, Jin-Bao Jian, Huihui Yang
Publication date: 27 September 2023
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2023.2189718
unconstrained optimizationglobal convergenceimage restorationhybrid conjugate gradient methodnonlinear monotone equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization
- Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing
- The convergence properties of some new conjugate gradient methods
- Efficient generalized conjugate gradient algorithms. I: Theory
- Hybrid conjugate gradient algorithm for unconstrained optimization
- Efficient hybrid conjugate gradient techniques
- An efficient three-term conjugate gradient method for nonlinear monotone equations with convex constraints
- Multivariate spectral gradient projection method for nonlinear monotone equations with convex constraints
- Hybridization of accelerated gradient descent method
- A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications
- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
- A new family of hybrid three-term conjugate gradient methods with applications in image restoration
- Nonlinear conjugate gradient methods for unconstrained optimization
- A note on hybridization process applied on transformed double step size model
- A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
- Spectral gradient projection method for monotone nonlinear equations with convex constraints
- A conjugate gradient projection method for solving equations with convex constraints
- A derivative-free iterative method for nonlinear monotone equations with convex constraints
- A hybrid conjugate gradient method with descent property for unconstrained optimization
- A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization
- A projection method for a system of nonlinear monotone equations with convex constraints
- Another hybrid conjugate gradient algorithm for unconstrained optimization
- A new family of conjugate gradient methods
- Testing Unconstrained Optimization Software
- Restart procedures for the conjugate gradient method
- A class of conjugate gradient methods for convex constrained monotone equations
- Inexact Newton methods for the nonlinear complementarity problem
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Hybridization rule applied on accelerated double step size optimization scheme
- A new two-parameter family of nonlinear conjugate gradient methods
- A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Function minimization by conjugate gradients
- CUTEr and SifDec
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- Benchmarking optimization software with performance profiles.
- An efficient hybrid conjugate gradient method for unconstrained optimization
This page was built for publication: Two families of hybrid conjugate gradient methods with restart procedures and their applications